Issue No. 02 - February (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2156
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
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. Ramarao, "Distributed Sorting on Local Area Networks," in IEEE Transactions on Computers, vol. 37, no. , pp. 239-243, 1988.