A NOTE ON COARSE GRAINED PARALLEL INTEGER SORTING
1999 ◽
Vol 09
(04)
◽
pp. 533-538
◽
Keyword(s):
We observe that for n/p ≥ p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds (6 [Formula: see text]-relations and 18 p-relations), O (n/p) memory per processor and O (n/p) local computation. Experimental data indicates that the algorithm has very good performance in practice.
2018 ◽
Keyword(s):
Keyword(s):
1985 ◽
Vol 49
(350)
◽
pp. 71-75
◽
Keyword(s):
2012 ◽
Vol 8
(9)
◽
pp. e1002683
◽
2017 ◽
2016 ◽
Vol 49
(6)
◽
pp. 1861-1875
◽
Keyword(s):