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)

Full work available at URL https://doi.org/10.1109/TC.1985.5009389

zbMATH Keywords

communication complexitycommunication networkdistributed algorithmsmessage complexityminimum spanning treeselectionsorting

Mathematics Subject Classification ID

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

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

(16)

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

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)