Published December 1990
| public
Journal Article
Distributed sorting
Chicago
An error occurred while generating the citation.
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.
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.Additional details
- Eprint ID
- 80946
- Resolver ID
- CaltechAUTHORS:20170830-083320673
- Created
-
2017-08-30Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field