Deterministic distribution sort in shared and distributed memory multiprocessors
Mark H. Nodine, Jeffrey Scott Vitter · ACM Symposium on Parallel Algorithms and Architectures (SPAA) · 1993
We present an elegant deterministic load balancing strategy for distribution sort that is applicable to a wide variety of parallel diska and parallel memory hierarchies with both single and parallel processors.The simplest application
Cited by 94 works. doi:10.1145/165231.165247 Open-access PDF
Authors
References
- Time bounds for selection
- A case for redundant arrays of inexpensive disks (RAID)
- A case for redundant arrays of inexpensive disks (RAID)
- Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- The input/output complexity of sorting and related problems
- I/O complexity
- Permuting Information in Idealized Two-Level Storage
- Parallel Merge Sort
- A simple parallel algorithm for the maximal independent set problem