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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings - IEEE International Parallel and Distributed Processing Symposium s. 137 - 147
Hlavní autoři: Bingmann, Timo, Sanders, Peter, Schimek, Matthias
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2020
Témata:
Arrays
Buildings
Clustering algorithms
communication-efficient algorithm
distributed-memory algorithm
Merging
Partitioning algorithms
Sorting
string sorting
ISSN:1530-2075
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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.
AbstractList 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.
Author Sanders, Peter
Bingmann, Timo
Schimek, Matthias
Author_xml – sequence: 1
  givenname: Timo
  surname: Bingmann
  fullname: Bingmann, Timo
  organization: Karlsruhe Institute of Technology,Karlsruhe,Germany
– sequence: 2
  givenname: Peter
  surname: Sanders
  fullname: Sanders, Peter
  organization: Karlsruhe Institute of Technology,Karlsruhe,Germany
– sequence: 3
  givenname: Matthias
  surname: Schimek
  fullname: Schimek, Matthias
  organization: Karlsruhe Institute of Technology,Karlsruhe,Germany
BookMark eNotjU9LwzAcQKMouM19AhF28pb6y99fcpQ6dTBwUD2PJk0kYlNp48Fvb2Ge3uXx3pJc5CEHQm4ZVIyBvd8dHg-NRMtlxYFDBQBcnpG1RcOQG6YNajgnC6YEUA6orshymj5nC4S0C3JXD33_k5NvSxoy3caYfAq5bJoypvyxaYaxzLwml7H9msL6nyvy_rR9q1_o_vV5Vz_saZp7hWrkYFRrovYdcBf9fNSCddY7h51G5lD5GJzTKLlmHQSwqDGg80Ipz8WK3Jy6KYRw_B5T346_R8uENaDEHzYPQqc
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/IPDPS47924.2020.00024
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781728168760
1728168767
EISSN 1530-2075
EndPage 147
ExternalDocumentID 9139805
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
ID FETCH-LOGICAL-i203t-672085a8f6cd02bfc207631d9cbb7d671b75cfebb674261d0e09767e7bc355c23
IEDL.DBID RIE
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000643734800014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:33:56 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-672085a8f6cd02bfc207631d9cbb7d671b75cfebb674261d0e09767e7bc355c23
PageCount 11
ParticipantIDs ieee_primary_9139805
PublicationCentury 2000
PublicationDate 2020-May
PublicationDateYYYYMMDD 2020-05-01
PublicationDate_xml – month: 05
  year: 2020
  text: 2020-May
PublicationDecade 2020
PublicationTitle Proceedings - IEEE International Parallel and Distributed Processing Symposium
PublicationTitleAbbrev IPDPS
PublicationYear 2020
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0020349
Score 1.7683243
Snippet There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this...
SourceID ieee
SourceType Publisher
StartPage 137
SubjectTerms Arrays
Buildings
Clustering algorithms
communication-efficient algorithm
distributed-memory algorithm
Merging
Partitioning algorithms
Sorting
string sorting
Title Communication-Efficient String Sorting
URI https://ieeexplore.ieee.org/document/9139805
WOSCitedRecordID wos000643734800014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED2VioGpQIv4VgbEhKnjJrl4hlawVJEKUrfK51xQlxSVlN9fOw0BJBY2K4Ojs5P7sO-9B3CjKIpzLljYXFsRRZSKtHDfMqPzjIkiGkmqxSZwOk3nc5114K7FwjBz3XzG935Y3-XnK7vxR2VDT2GZesLSPUTcYbXa4srzrDQInVDq4XP2mM0idNWFqwGVb9-SHtT-Q0GlDiCT3v9efQiDbyRekLUx5gg6XB5D70uKIWj-zD7c_gJ6iHFNDOFmDGaVP7gLZivPFvA2gNfJ-OXhSTQSCGLpLKpEgl5D06RFYnOpqLBKOocQunUlwjzBkDC2BRMl6GuhXLJ0-QUyknWJhFWjE-iWq5JPIXCh3sZSaRNrl3OYwsTWmJSUDjUn0tAZ9L3Zi_cdy8Wisfj878cXcODXddf6dwndar3hK9i3n9XyY31db80WT7ePjQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4haKInVDD-dgfjyUpXtnU9KwQiLkvAhBvp694MFzA4_Pttx5yaePHW7NDltdv70b7v-wBuBAZhRjkxkynDggBjFuf2WyZpPWMkEHscS7EJmSTxbKbSBtzVWBgiKpvP6N4Ny7v8bGU27qis6ygsY0dYuhMGgfC3aK26vHJMKxVGx-eqO0of00kgbX1hq0DhGri4g7X_0FApQ8ig9b-XH0DnG4vnpXWUOYQGLY-g9SXG4FX_Zhtuf0E9WL-khrAzepPCHd15k5XjC3jtwMugP30YskoEgS2sRQWLpFPR1HEemYwLzI3g1iX4dmURZRZJH2VockKMpKuGMk7cZhiSJBqbShjRO4bmcrWkE_BssDchF0qHymYdOteh0TpGoXxFEdd4Cm1n9vxty3Mxryw--_vxNewNp8_j-XiUPJ3DvlvjbSPgBTSL9YYuYdd8FIv39VW5TZ_7XZLU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+-+IEEE+International+Parallel+and+Distributed+Processing+Symposium&rft.atitle=Communication-Efficient+String+Sorting&rft.au=Bingmann%2C+Timo&rft.au=Sanders%2C+Peter&rft.au=Schimek%2C+Matthias&rft.date=2020-05-01&rft.pub=IEEE&rft.eissn=1530-2075&rft.spage=137&rft.epage=147&rft_id=info:doi/10.1109%2FIPDPS47924.2020.00024&rft.externalDocID=9139805