Tight bounds for distributed selection

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 145-153

  Kuhn, Fabian ^a   Locher, Thomas ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Data aggregation; Distributed algorithms; In network aggregation; Median; Sensor networks; Time complexity

Indexed keywords

ASYMPTOTIC ANALYSIS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PARALLEL ALGORITHMS; PROBABILITY; SENSOR NETWORKS;

DISTRIBUTED SELECTIONS; IN NETWORK AGGREGATION; MEDIAN; TIGHT BOUNDS; TIME COMPLEXITY;

DATA REDUCTION;

EID: 35248881080     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248401     Document Type: Conference Paper

References (18)

1. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time Bounds for Selection. Journal of Computer and System Sciences, 7:448-461, 1973.
2. F. Y. L. Chin and H. F. Ting. An Improved Algorithm for Finding the Median Distributively. Algorithmica, 2:77-86, 1987.
3. G. N. Frederickson. Tradeoffs for Selection in Distributed Networks. In Proc. 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 154-160, 1983.
4. D. Kempe, A. Dobra, and J. Gehrke. Gossip-Based Computation of Aggregate Information. In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
5. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks. In Proc. 5th Annual Symposium on Operating Systems Design and Implementation (OSDI), pages 131-146, 2002.
6. J. M. Marberg and E. Gafni. An Optimal Shout-Echo Algorithm for Selection in Distributed Sets. In Proc. 23rd Allerton Conf. Comm., Control, and Computing, 1985.
7. A. Negro, N. Santoro, and J. Urrutia. Efficient Distributed Selection with Bounded Messages. IEEE Trans. Parallel and Distributed Systems, 8(4):397-401, 1997.
8. B. Patt-Shamir. A Note on Efficient Aggregate Queries in Sensor Networks. In Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 283-289, 2004.
9. M. Rodeh. Finding the Median Distributively. J. Computer and System Science, 24(2): 162-166, 1982.
10. D. Rodem, N. Santoro, and J.B. Sidney. Shout-Echo Selection in Distributed Files. Networks, 16:235-249, 1986.
11. N. Santoro, M. Scheutzow, and J. B. Sidney. On the Expected Complexity of Distributed Selection. J. Parallel and Distributed Computing, 5(2): 194-203, 1988.
12. N. Santoro, J. B. Sidney, and S. J. Sidney. A Distributed Selection Algorithm and Its Expected Communication Complexity. Theoretical Computer Science, 100(1): 185-204, 1992.
13. N. Santoro and J.B. Sidney. Order Statistics on Distributed Sets. In Proc. 20th Allerton Conf. Comm., Control, and Computing, pages 251-256, 1982.
14. N. Santoro and E. Suen. Reduction Techniques for Selection in Distributed Files. IEEE Trans. Computers, 38(6):891-896, 1989.
15. A. Schönhage, M. S. Paterson, and N. Pippenger. Finding the Median. Journal of Computer and System Sciences, 13:184-199, 1976.
16. L. Shrira, N. Francez, and M. Rodeh. Distributed k-Selection: From a Sequential to a Distributed Algorithm. In Proc. 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 143-153, 1983.
17. Y. Yao and J. Gehrke. The Cougar Approach to In-Network Query Processing in Sensor Networks. ACM SIGMOD Record, 31(3):9-18, 2002.
18. J. Zhao, R. Govindan, and D. Estrin. Computing Aggregates for Monitoring Wireless Sensor Networks. In Proc. 1st IEEE International Workshop on Sensor Network Protocols and Applications (SNPA), 2003.