The complexity of sorting on distributed systems

DOI10.1016/S0019-9958(84)80022-4MaRDI QIDQ3718163zbMATH OpenFDO

Authors Michael C. Loui

Publication date 1984

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(84)80022-4

zbMATH Keywords

sorting algorithm for unidirectional rings

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Optimal Distributed Algorithms for Sorting and Ranking
• Sorting on a ring of processors
• The bit complexity of distributed sorting
• Distributed Sorting
• Lower bounds for sorting on mesh-connected architectures

Cited in

(14)

• Bit complexity of order statistics on a distributed star network
• The bit complexity of distributed sorting
• A time-optimal distributed sorting algorithm on a line network.
• Sorting algorithms for broadcast communications: mathematical analysis.
• Message lower bounds via efficient network synchronization
• SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
• The round complexity of distributed sorting, extended abstract
• Distributed Sorting
• Optimal Distributed Algorithms for Sorting and Ranking
• Sorting a distributed file in a network
• scientific article; zbMATH DE number 4043263 (Why is no real title available?)
• Distributed sorting
• Scattering on a ring of processors
• Distributed selectsort sorting algorithms on broadcast communication networks

This page was built for publication: The complexity of sorting on distributed systems

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