Distributed Sorting

DOI10.1109/TC.1985.5009389MaRDI QIDQ3219775zbMATH OpenFDO

Authors Doron Rotem, Jeffrey B. Sidney, N. Santoro

Publication date 1985

Published in IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treeselectiondistributed algorithmscommunication networksortingcommunication complexitymessage complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Recommendations

• Sorting a distributed file in a network
• The complexity of sorting on distributed systems
• Optimal Distributed Algorithms for Sorting and Ranking
• The bit complexity of distributed sorting
• Distributed sorting

Cited in

(15)

• Efficient selection and sorting schemes using coteries for processing large distributed files
• Bit complexity of order statistics on a distributed star network
• On the collective sort problem for distributed tuple spaces
• Sloping-and-shaking
• The Mayor's dilemma
• Distributed sorting
• Sorting algorithm analysis of distributed data based on Map/Reduce
• Distributing a \(B^+\)-tree in a loosely coupled environment
• Optimal Distributed Algorithms for Sorting and Ranking
• A time-optimal distributed sorting algorithm on a line network.
• Distributed selectsort sorting algorithms on broadcast communication networks
• A distributed selection algorithm and its expected communication complexity
• The complexity of sorting on distributed systems
• SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
• Sorting a distributed file in a network

This page was built for publication: Distributed Sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219775)