The Community for Technology Leaders
RSS Icon
Subscribe
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
ISBN: 978-1-4244-5445-7
pp: 685-688
Mirko Rahn , Karlsruhe Institute of Technology, Postfach 6980, 76128, Germany
Peter Sanders , Karlsruhe Institute of Technology, Postfach 6980, 76128, Germany
Johannes Singler , Karlsruhe Institute of Technology, Postfach 6980, 76128, Germany
ABSTRACT
We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway merging paradigm. We first outline an algorithm whose I/O requirement is close to a lower bound. Thus, in contrast to naive implementations of multiway merging and all other approaches known to us, the algorithm works with just two passes over the data even for the largest conceivable inputs. A second algorithm reduces communication overhead and uses more conventional specifications of the result at the cost of slightly increased I/O requirements. An implementation wins the well known sorting benchmark in several categories and by a large margin over its competitors.
CITATION
Mirko Rahn, Peter Sanders, Johannes Singler, "Scalable distributed-memory external sorting", ICDE, 2010, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2010, pp. 685-688, doi:10.1109/ICDE.2010.5447865
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool