A simple parallel sort as a demonstration of how easy (and fast) this is in C++
| Révision | l'heure | Auteur | Message: RSS |
| 9974a2cf | 2021-06-15 22:27:07 | Eric Hopper | Put copyright notices in source files. |
| 9fd31491 | 2018-12-16 16:32:04 | Eric Hopper | It's GPLv3. |
| a1bbbd5e | 2018-12-16 16:23:53 | Eric Hopper | Add a README |
| ed8c2878 | 2018-12-16 15:54:51 | Eric Hopper | Switched to using raw arrays instead of vectors. <obj si... |
| e36b2c2f | 2018-12-13 03:20:17 | Eric Hopper | Initial versions of a C sort vs. a C++ sort. |
This is just me playing around with a simple parallelization for sorting a large array of integers.
I'm mostly please with how I used a queue to end the whole thing with a set of maximally parallel merges.
I also wrote a non-parallel version in C. C doesn't have widely available portable threading.
Welcome to OSDN Wiki system. Here is your chamber Wiki space.
Check Wiki Guide (English) to refer syntax and functions.
omnifarious
Fork
edit