Parallel algorithms for personalized communication and sorting with an experimental study (extended abstract)
David R. Helman, David A. Bader, Joseph F. JáJá · 1996
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, algorithms which execute efficiently on general-purpose parallel machines.With ing problem posed by the NAS Integer Sorting ( 1S) Benchmark.