DocumentCode
962558
Title
Distributed Sorting
Author
Rotem, Doron ; Santoro, Nicola ; Sidney, Jeffrey B.
Author_Institution
Department of Computer Science, University of Waterloo, Waterloo, Ont., Canada.
Issue
4
fYear
1985
fDate
4/1/1985 12:00:00 AM
Firstpage
372
Lastpage
376
Abstract
The problem of sorting a file distributed over a number of sites of a communication network is examined. Two versions of this problem are investigated; distributed solution algorithms are presented; and their communication complexity analyzed both in the worst and in the average case. The worst case bounds are shown to be sharp, with respect to order of magnitude, for large files.
Keywords
Algorithm design and analysis; Communication networks; Complexity theory; Computer science; Councils; Distributed computing; Sorting; Water storage; Distributed algorithms; message complexity; minimum spanning tree; selection; sorting;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1985.5009389
Filename
5009389
Link To Document