A Caltech Library Service

Distributed sorting

Hofstee, H. Peter and Martin, Alain J. and Van de Snepscheut, Jan L. A. (1990) Distributed sorting. Science of Computer Programming, 15 (2-3). pp. 119-133. ISSN 0167-6423. doi:10.1016/0167-6423(90)90081-N.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


In this paper we present a distributed sorting algorithm, which is a variation on exchange sort, i.e., neighboring elements that are out of order are exchanged. We derive the algorithm by transforming a sequential algorithm into a distributed one. The transformation is guided by the distribution of the data over processes. First we discuss the case of two processes, and then the general case of one or more processes. Finally we propose a more efficient solution for the general case.

Item Type:Article
Related URLs:
URLURL TypeDescription
ttp:// ItemTechnical Report
Additional Information:© 1990 Elsevier Science. Revised June 1990. We are grateful to Johan J. Lukkien for many discussions during the design of the algorithms, and to Wayne Luk for helpful remarks on the presentations.
Issue or Number:2-3
Record Number:CaltechAUTHORS:20170830-083320673
Persistent URL:
Official Citation:H.Peter Hofstee, Alain J. Martin, Jan L.A. Van De Snepscheut, Distributed sorting, Science of Computer Programming, Volume 15, Issue 2, 1990, Pages 119-133, ISSN 0167-6423, (
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:80946
Deposited By: Ruth Sustaita
Deposited On:30 Aug 2017 16:02
Last Modified:15 Nov 2021 19:39

Repository Staff Only: item control page