Distributed sorting

DOI10.1016/0167-6423(90)90081-NMaRDI QIDQ753491zbMATH OpenOpenAlexFDO

Authors H. Peter Hofstee, Alain J. Martin, Jan L. A. van de Snepscheut

Publication date 1990

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(90)90081-n

zbMATH Keywords

communicating sequential processesdistributed sortingparallelization

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Review text

The papers deals with distributed sorting. The idea is that given a finite set of nonempty bags (with numbers to be sorted) and a linear array of processes, each of the processors contains a bag and communicates through channels with its neighbors in the array. Clearly this model can be implemented on a system with transputers. The main operation is the exchange of the maximum element of the bag i with the minimum element of bag \(i+1\) till the sorting is fulfilled. As the authors claim, the paper is just an exercise in deriving parallel programs.

Recommendations

• Distributed Sorting
• Sorting in Parallel
• Sorting a distributed file in a network
• scientific article; zbMATH DE number 622472
• The complexity of sorting on distributed systems

Cited in

(5)

• A time-optimal distributed sorting algorithm on a line network.
• Distributed Sorting
• Sorting a distributed file in a network
• scientific article; zbMATH DE number 622472 (Why is no real title available?)
• EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES

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 Q753491)