LCS Publication Details
Publication Title: OPTIMAL DISTRIBUTED ALGORITHMS FOR SORTING AND RANKING
Publication Author: Zaks, Shmuel
Additional Authors:
LCS Document Number: MIT-LCS-TM-261
Publication Date: 5-1-1984
LCS Group: No Group Specified
Additional URL: No URL Given
Abstract:
We study the problems of sorting ranking n processors that have initial values - not necessarily distinct - in a distributed system. Sorting means that the initial values have to move around in the network and be assigned to the processors according to their distinct identities, while ranking means that the numbers 1,2,...,n have to be assigned to the processors according to their initial values; ties between initial values can be broken in any chosen way.
To obtain this publication:

To purchase a printed copy of this publication please contact MIT Document Services.