Issue No.06 - June (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24301
The problem of selecting the Kth smallest element of a set of N elements distributed among d sites of a communication network is examined. A reduction technique is a distributed algorithm that transforms this problem to an equivalent one where either K or N (or both) are reduced. A collection of distributed reduction techniques is presented; the combined use of the algorithms offers new solutio
distributed files; communication network; reduction technique; distributed algorithm; distributed reduction techniques; shout-echo networks; point-to-point networks; communication complexity; multiplicative constant; distributed processing; file organisation; telecommunication networks.
N. Santoro, E. Suen, "Reduction Techniques for Selection in Distributed Files", IEEE Transactions on Computers, vol.38, no. 6, pp. 891-896, June 1989, doi:10.1109/12.24301