A simple parallel sort as a demonstration of how easy (and fast) this is in C++
リビジョン | a1bbbd5ea63c394a8e460064c87df673f0dbdd3e (tree) |
---|---|
日時 | 2018-12-16 16:23:53 |
作者 | Eric Hopper <hopper@omni...> |
コミッター | Eric Hopper |
Add a README
@@ -0,0 +1,10 @@ | ||
1 | +# C++ Parallel Sort Test # | |
2 | + | |
3 | +This is just me playing around with a simple parallelization for sorting | |
4 | +a large array of integers. | |
5 | + | |
6 | +I'm mostly please with how I used a queue to end the whole thing with a | |
7 | +set of maximally parallel merges. | |
8 | + | |
9 | +I also wrote a non-parallel version in C. C doesn't have widely | |
10 | +available portable threading. |