Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 1989 | Accepted Version
Report Open

Distributed Sorting

Abstract

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.

Attached Files

Accepted Version - CS_TR_90_06.pdf

Accepted Version - postscript.ps

Files

CS_TR_90_06.pdf
Files (728.1 kB)
Name Size Download all
md5:641d6e12e423ba4e70bd85ab7ebd479f
630.5 kB Preview Download
md5:d03fc1550f29b77c130a44e644a864f2
97.6 kB Download

Additional details

Created:
August 19, 2023
Modified:
December 22, 2023