Automatic generation of a parallel sorting algorithm
Brian A. Garber, Daniel E. Hoeflinger, Xiaoming Li et al. · Proceedings - IEEE International Parallel and Distributed Processing Symposium · 2008
In this paper, we discuss a library generator for parallel sorting routines that examines the input characteristics (and the parameters they affect) to select the best performing algorithm. Our preliminary experimental results show that the automatic generation of a distributed memory parallel sorting routine provides up to a four fold improvement over standard parallel algorithms with typical parameters. With the recent importance of multicore processors, we are extending this work to shared memory. This provides new challenges specific to multicore systems. However, with their increasing popularity, this extension becomes very valuable.
Cited by 5 works. doi:10.1109/ipdps.2008.4536400
Authors
References
- Automated empirical optimizations of software and the ATLAS project
- SPIRAL: Code Generation for DSP Transforms
- Using MPI
- A fast Fourier transform compiler
- High-level optimization via automated statistical modeling
- Parallel sorting by regular sampling
- A framework for adaptive algorithm selection in STAPL
- Optimizing Sorting with Genetic Algorithms
- A dynamically tuned sorting library
- CC-Radix: a cache conscious sorting based on Radix sort