Efficient distributed selection with bounded messages

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 4, 1997, Pages 397-401

  Negro, Alberto ^b   Santoro, Nicola ^a,c   Urrutia, Jorge ^d  

^a IEEE   (Canada)

^b UNIVERSITY OF SALERNO   (Italy)

^c CARLETON UNIVERSITY   (Canada)

^d UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Bounded size messages; Communication complexity; Communication networks; Distributed algorithms; Distributed sets; K selection

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK TOPOLOGY;

BOUNDED SIZE MESSAGES; PACKET COMPLEXITY;

PACKET NETWORKS;

EID: 0031124067     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.588617     Document Type: Article

References (16)

1. J.L. Bentley and A.C. Yao, "An Almost Optimal Algorithm for Unbounded Searching," Information Processing Letters, vol. 5, no. 3, pp. 82-87, Aug. 1976.
2. F. Chin and H.F. Ting, "An Improved Algorithm for Finding the Median Distributively," Algorithmica, vol. 2, pp. 235-249, 1987.
3. M.Y. Chan, "Efficient and Resilient Distributed Algorithms for Comparison Problems," PhD Thesis, Univ. of Hong Kong, Oct. 1987.
4. G.N. Frederickson, "Tradeoffs for Selection in Distributed Networks," Proc. Second ACM Symp. Principles of Distributed Computing, pp. 154-160, Montreal, Aug. 1983.
5. R.G. Gallager, P.A. Humblet, and P.M. Spira, "A Distributed Algorithm for Minimum Spanning Tree," ACM Trans. Programming Languages and Systems, vol. 5, no. 1, pp. 66-77, 1983.
6. O. Gestel, Y. Mansour, and S. Zaks, "Bit Complexity of Order Statistics on a Distributed Star Network," Information Processing Letters, vol. 30, pp. 127-132, 1989.
7. J.M. Marberg and E. Gafni, "An Optimal Shout-Echo Algorithm for Selection in Distributed Sets," Proc. 23rd Allerton Conf. Comm., Control, and Computing, Monticello, Oct. 1985.
8. T.A. Matsushita, "Distributed Algorithms for Selection," masters thesis, Dept. of Computer Science, Univ. of Illinois, Urbana, July 1983.
9. M. Rodeh, "Finding the Median Distributively," J. Computer and System Science, vol. 24, no. 2, 162-167, Apr. 1982.
10. D. Rotem, N. Santoro, and J.B. Sidney, "Distributed Sorting," IEEE Trans. Computers, vol. 34, no. 4, pp. 372-376, Apr. 1985.
11. D. Rotem, N. Santoro, and J.B. Sidney, "Shout-Echo Selection in Distributed Files," Networks, vol. 16, pp. 77-86, 1986.
12. N. Santoro, M. Scheutzow, and J.B. Sidney, "On the Expected Complexity of Distributed Selection," J. Parallel and Distributed Computing, vol. 5, pp. 194-203, 1988.
13. N. Santoro and J.B. Sidney, "Order Statistics on Distributed Sets," Proc. 20th Allerton Conf. Comm., Control, and Computing, pp. 251-256, Monticello, Oct. 1982.
14. N. Santoro, J.B. Sidney, and S.J. Sidney, "A Distributed Selection Algorithm and Its Expected Communication Complexity," Theoretical Computer Science, vol. 100, pp. 185-204, 1992.
15. N. Santoro and E. Suen, "Reduction Techniques for Selection in Distributed Files," IEEE Trans. Computers, vol. 38, no. 6, pp. 891-896, June 1989.
16. L. Shrira, N. Francez, and M. Rodeh, "Distributed k-Selection: From a Sequential to a Distributed Algorithm," Proc. Second ACM Symp. Principles of Distributed Computing, pp. 143-153, Montreal, Aug. 1983.