Communication-Efficient String Sorting

There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this problem based on the multi-way merging principle. These algorithms inspect only characters that are needed to determine the sorting order. Moreo...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 137 - 147
Main Authors:	Bingmann, Timo, Sanders, Peter, Schimek, Matthias
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2020
Subjects:	Arrays Buildings Clustering algorithms communication-efficient algorithm distributed-memory algorithm Merging Partitioning algorithms Sorting string sorting
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this problem based on the multi-way merging principle. These algorithms inspect only characters that are needed to determine the sorting order. Moreover, communication volume is reduced by also communicating (roughly) only those characters and by communicating repetitions of the same prefixes only once. Experiments on up to 1280 cores reveal that these algorithm are often more than five times faster than previous algorithms.
ISSN:	1530-2075
DOI:	10.1109/IPDPS47924.2020.00024