A simple parallel sort as a demonstration of how easy (and fast) this is in C++
| Nombre | Tamaño | Rev. | Tiempo | Autor | Log Message |
|---|---|---|---|---|---|
 LICENSE |
34.32 k | 9fd31491d7ad | 2018-12-16 16:32:04 | Eric Hopper <hopper@omnifarious.org> | It's GPLv3. |
| README.md |
330 | a1bbbd5ea63c | 2018-12-16 16:23:53 | Eric Hopper <hopper@omnifarious.org> | Add a README |
 csort.c |
1.03 k | 9974a2cf9a56 | 2021-06-15 22:27:07 | Eric Hopper <hopper@omnifarious.org> | Put copyright notices in source files. |
 mysort.cpp |
4.03 k | 9974a2cf9a56 | 2021-06-15 22:27:07 | Eric Hopper <hopper@omnifarious.org> | Put copyright notices in source files. |
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.
omnifarious
Fork