This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reduction Techniques for Selection in Distributed Files
June 1989 (vol. 38 no. 6)
pp. 891-896
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

[1] F. Chin and H. F. Ting, "A near-optimal algorithm for finding the median distributively," inProc. 5th IEEE Conf. Distribut. Comput. Syst., Denver, CO, May 1985.
[2] G. N. Frederickson, "Tradeoffs for selection in distributed networks," inProc. 2nd ACM PODC, Aug. 1983, pp. 154-160.
[3] G. N. Frederickson and D. B. Johnson, "The complexity of selection and ranking inX+Yand matrices with sorted columns,"J. Comput. Syst. Sci., vol. 24, pp. 197-208, Apr. 1982.
[4] D. B. Johnson and T. Mizoguchi, "Selecting theKth element inX+YandX1+X2+...+Xm," SIAM J. Comput., vol. 7, pp. 556-570, 1978.
[5] J. M. Marberg and E. Gafni, "An optimal shout-echo algorithm for selection in distributed sets,"Proc. 23rd Allerton Conf. Commun., Contr., Comput., Monticello, Oct. 1985.
[6] T. A. Matsuhita, "Distributed algorithms for selection," Master Thesis, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, July 1983.
[7] M. Rodeh, "Finding the median distributively,"J. Comput. Syst. Sci., vol. 24, pp. 162-167, Apr. 1982.
[8] D. Rotem, N. Santoro, and J. B. Sidney, "A shout-echo algorithm for finding the median of a distributed set," inProc. 14th SE Conf. Combinatorics, Graph Theory Comput., Boca Raton, FL, Feb. 1983, pp. 311-318.
[9] D. Rotem, N. Santoro, and J. B. Sidney, "Distributed sorting,"IEEE Trans. Comput., vol. C-34, pp. 362-376, Apr. 1985.
[10] D. Rotem, N. Santoro, and J. B. Sidney, "Shout-echo selection in distributed files,"Networks, vol. 16, pp. 77-86, 1986.
[11] N. Santoro, M. Scheutzow, and J. B. Sidney, "On the expected communication complexity of distributed selection,"J. Parallel Distribut. Comput., to be published.
[12] N. Santoro and J. B. Sidney, "Order statistics on distributed sets," inProc. 20th Allerton Conf. Commun., Contr., Comput., Monticello, Oct. 1982, pp. 251-256.
[13] N. Santoro, J. B. Sidney, and S. J. Sidney, "On the expected complexity of distributed selection," inProc. 4th Symp. Theoret. Aspects Comput. Sci., Passau, Feb. 1987, pp. 456-467.
[14] L. Shirira, N. Francez, and M. Rodeh, "Distributedk-selection: From a sequential to a distributed algorithm," inProc. 2nd ACM Symp. Principles of Distribut. Comput., Montreal, P.Q., Canada, Aug. 1983, pp. 143-153.

Index Terms:
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.
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.