Abstract
Two novel variations on sample sort, one using only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead and another using regular sampling for choosing splitters, were studied. The two were coded in Split-C and were run on a variety of platforms. Results were consistent with theoretical analysis and illustrated the scalability and efficiency of the algorithms.
| Original language | American English |
|---|---|
| Pages | 211-222 |
| Number of pages | 12 |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy Duration: Jun 24 1996 → Jun 26 1996 |
Other
| Other | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures |
|---|---|
| City | Padua, Italy |
| Period | 6/24/96 → 6/26/96 |
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality