Distributed Thresholded Counting with Limited Interaction
Pages 4664 - 4675
Abstract
Problems in the area of distributed computing have been extensively studied. In this paper, we focus on the Distributed Thresholded Counting problem in the coordinator model. In this problem, we have k sites holding their input and communicating with a central coordinator. The coordinator's task is to determine whether the sum of inputs is larger than a threshold. While the communication complexity of this basic problem has been studied for decades, it is still not well understood. Our work considers the worst-case communication cost for an algorithm that uses limited interaction - i.e. a bounded number of rounds of communication. Algorithms in previous research usually need O(łogłog N) or O(k) rounds. In comparison, in the deterministic case, our algorithm achieves optimal communication complexity in only α(k) rounds, where α(k) denotes the inverse Ackermann function and is nearly constant. We also give a randomized algorithm that balances communication, rounds, and error probability.
Supplemental Material
MP4 File - rtp1168-2min-promo
The promotional video starts by describing the distributed thresholded counting problem. It then presents the results of previous research and the new algorithms presented in this paper
- Download
- 8.28 MB
References
[1]
Noga Alon and Yossi Azar. 1989. Finding an approximate maximum. SIAM J. Comput., Vol. 18, 2 (1989), 258--267.
[2]
Daniel Apon, Jonathan Katz, and Alex J Malozemoff. 2013. One-round multi-party communication complexity of distinguishing sums. Theoretical Computer Science, Vol. 501 (2013), 101--108.
[3]
Sepehr Assadi, Gillat Kol, and Zhijun Zhang. 2022. Rounds vs communication tradeoffs for maximal independent sets. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 1193--1204.
[4]
Mark Braverman and Rotem Oshman. 2015. On information complexity in the broadcast model. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. 355--364.
[5]
Mark Braverman and Rotem Oshman. 2017. A rounds vs. communication tradeoff for multi-party set disjointness. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 144--155.
[6]
Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P Woodruff, and Grigory Yaroslavtsev. 2014. Beyond set disjointness: the communication complexity of finding the intersection. In Proceedings of the 2014 ACM symposium on Principles of distributed computing. 106--113.
[7]
Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P Woodruff, and Grigory Yaroslavtsev. 2014. Certifying equality with limited interaction. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[8]
Badrish Chandramouli, Suman Nath, and Wenchao Zhou. 2013. Supporting distributed feed-following apps over edge devices. Proceedings of the VLDB Endowment, Vol. 6, 13 (2013), 1570--1581.
[9]
Graham Cormode. 2013. The continuous distributed monitoring model. ACM SIGMOD Record, Vol. 42, 1 (2013), 5--14.
[10]
Graham Cormode, Shanmugavelayutham Muthukrishnan, and Ke Yi. 2011. Algorithms for distributed functional monitoring. ACM Transactions on Algorithms (TALG), Vol. 7, 2 (2011), 1--20.
[11]
Olivier Devillers. 1992. Randomization yields simple $o (n łog^* n)$ algorithms for difficult $ømega$ (n) problems. International Journal of Computational Geometry & Applications, Vol. 2, 01 (1992), 97--111.
[12]
Danny Dolev and Tomás Feder. 1989. Multiparty communication complexity. IBM Thomas J. Watson Research Division.
[13]
Jürgen Forster, Niels Schmitt, Hans Ulrich Simon, and Thorsten Suttorp. 2003. Estimating the optimal margins of embeddings in euclidean half spaces. Machine Learning, Vol. 51 (2003), 263--281.
[14]
Dawei Huang, Seth Pettie, Yixiang Zhang, and Zhijun Zhang. 2021. The communication complexity of set intersection and multiple equality testing. SIAM J. Comput., Vol. 50, 2 (2021), 674--717.
[15]
Zengfeng Huang, Ke Yi, and Qin Zhang. 2019. Randomized algorithms for tracking distributed count, frequencies, and ranks. Algorithmica, Vol. 81, 6 (2019), 2222--2243.
[16]
Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li Shiuan Peh, and Daniel Rubenstein. 2002. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In Proceedings of the 10th international conference on Architectural support for programming languages and operating systems. 96--107.
[17]
Ram Keralapura, Graham Cormode, and Jeyashankher Ramamirtham. 2006. Communication-efficient distributed monitoring of thresholded counts. In Proceedings of the 2006 ACM SIGMOD international conference on Management of data. 289--300.
[18]
Nati Linial and Adi Shraibman. 2009. Learning complexity vs communication complexity. Combinatorics, Probability and Computing, Vol. 18, 1--2 (2009), 227--245.
[19]
Samuel R Madden, Michael J Franklin, Joseph M Hellerstein, and Wei Hong. 2005. TinyDB: an acquisitional query processing system for sensor networks. ACM Transactions on database systems (TODS), Vol. 30, 1 (2005), 122--173.
[20]
Noam Nisan. 1993. The communication complexity of threshold gates. Combinatorics, Paul Erdos is Eighty, Vol. 1 (1993), 301--315.
[21]
Mert Saglam and Gábor Tardos. 2013. On the communication complexity of sparse set disjointness and exists-equal problems. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE, 678--687.
[22]
Jochen Schiller and Agnès Voisard. 2004. Location-based services. Elsevier.
[23]
Emanuele Viola. 2015. The communication complexity of addition. Combinatorica, Vol. 35 (2015), 703--747.
[24]
David P Woodruff and Qin Zhang. 2013. When distributed computation does not help. CoRR, abs/1304.4636, Vol. 5 (2013).
[25]
Hao Wu, Junhao Gan, and Rui Zhang. 2020. Learning based distributed tracking. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2040--2050.
Index Terms
- Distributed Thresholded Counting with Limited Interaction
Index terms have been assigned to the content through auto-classification.
Recommendations
Certifying Equality With Limited Interaction
The equality problem is usually one's first encounter with communication complexity and is one of the most fundamental problems in the field. Although its deterministic and randomized communication complexity were settled decades ago, we find several ...
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe study the problem of approximate nearest neighbor search in $d$-dimensional Hamming space {0,1}d. We study the complexity of the problem in the famous cell-probe model, a classic model for data structures. We consider algorithms in the cell-probe ...
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
Special Issue on SPAA 2016We study the complexity of parallel data structures for approximate nearest neighbor search in d-dimensional Hamming space {0,1}d. A classic model for static data structures is the cell-probe model [27]. We consider a cell-probe model with limited ...
Comments
Information & Contributors
Information
Published In
August 2024
6901 pages
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 August 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSFC
Conference
KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
August 25 - 29, 2024
Barcelona, Spain
Acceptance Rates
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 97Total Downloads
- Downloads (Last 12 months)97
- Downloads (Last 6 weeks)15
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in