This Article 
 Bibliographic References 
 Add to: 
Distributed Sorting on Local Area Networks
February 1988 (vol. 37 no. 2)
pp. 239-243
A straight-line-topology local area network (LAN) to which a number of nodes are connected either in series or in parallel is considered. A file F is arbitrarily partitioned among these sites. The problem studied is that of rearranging the records of the file such that the keys of records at lower-ranking sites are all smaller than those at higher-ranking sites. Lower bounds on the worst-case c

[1] F. Chin and H. F. Ting, "A near-optimal algorithm for finding the median distributively," inProc. 5th Int. Conf. Distributed Comput. Syst., May 1985, pp. 459-465.
[2] G. N. Frederickson, "Tradeoffs for selection in distributed networks," inProc. 2nd ACM PODC, Aug. 1983, pp. 154-160.
[3] M. C. Loui, "The complexity of sorting on distributed systems,"Inform. Contr., vol. 60, no. 1-3, pp. 70-85.
[4] M. Rodeh, "Finding the median distributively,"JCSS, pp. 162-166, 1982.
[5] R. Rom, "Ordering subscribers on cable networks,"ACM TOCS, vol. 2, pp. 322-334, Nov. 1984.
[6] D. Rotem, N. Santoro, and J. B. Sydney, "Distributed sorting,"IEEE Trans. Comput., vol. C-34, pp. 372-376, Apr. 1985.
[7] D. Rotem, "A shout-echo selection in distributed files,"Networks, to be published.
[8] S. Zaks, "Optimal distributed algorithms for sorting and ranking,"IEEE Trans. Comput., vol. C-34, pp. 376-379, Apr. 1985.

Index Terms:
distributed sorting; lower bounds; optimal algorithms; straight-line-topology local area network; worst-case communication complexity; computational complexity; distributed processing; local area networks; sorting.
K.V.S. Ramarao, "Distributed Sorting on Local Area Networks," IEEE Transactions on Computers, vol. 37, no. 2, pp. 239-243, Feb. 1988, doi:10.1109/12.2156
Usage of this product signifies your acceptance of the Terms of Use.