Hofstee, H. Peter and Martin, Alain J. and Van de Snepscheut, Jan L. A. (1989) Distributed Sorting. California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1989.cs-tr-90-06
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_postscript.png)
|
Postscript
- Accepted Version
See Usage Policy. 97kB | |
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
- Accepted Version
See Usage Policy. 630kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1989.cs-tr-90-06
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.
| Item Type: | Report or Paper (Technical Report) | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| Group: | Computer Science Technical Reports | ||||||
| Other Numbering System: |
| ||||||
| Record Number: | CaltechCSTR:1989.cs-tr-90-06 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1989.cs-tr-90-06 | ||||||
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. | ||||||
| ID Code: | 26719 | ||||||
| Collection: | CaltechCSTR | ||||||
| Deposited By: | Imported from CaltechCSTR | ||||||
| Deposited On: | 25 Apr 2001 | ||||||
| Last Modified: | 03 Oct 2019 03:17 |
Repository Staff Only: item control page
