Cited By
View all- Chen BYu HZhao YGibbons P(2014)The Cost of Fault Tolerance in Multi-Party Communication ComplexityJournal of the ACM10.1145/259763361:3(1-64)Online publication date: 2-Jun-2014
The cost of fault tolerance in multi-party communication complexity
Pages 57 - 66
Abstract
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research, since the very beginning, has been to tolerate crash failures. It is thus natural to ask "If we want to compute a certain function in a fault-tolerant way, what will the communication complexity be?" This natural question, interestingly, has not been formally posed and thoroughly studied prior to this work.
Whether fault-tolerant communication complexity is interesting to study largely depends on how big a difference failures make. This paper proves that the impact of failures is significant, at least for the SUM aggregation function in general networks: As our central contribution, we prove that there exists (at least) an exponential gap between the non-fault-tolerant and fault-tolerant communication complexity of SUM. Our results also imply the optimality (within polylog factors) of some recent fault-tolerant protocols for computing SUM via duplicate-insensitive techniques, thereby answering an open question as well.
Part of our results are obtained via a novel reduction from a new two-party problem UNIONSIZECP that we introduce. UNIONSIZECP comes with a novel cycle promise, which is the key enabler of our reduction. We further prove that this cycle promise and UNIONSIZECP likely play a fundamental role in reasoning about fault-tolerant communication complexity.
References
[1]
N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In STOC, May 1996.
[2]
O. Ayaso, D. Shah, and M. Dahleh. Information theoretic bounds for distributed computation over networks of point-to-point channels. IEEE Transactions on Information Theory, 56(12):6020--6039, 2010.
[3]
T. Aysal, M. Yildiz, A. Sarwate, and A. Scaglione. Broadcast gossip algorithms for consensus. IEEE Transactions on Signal Processing, 57(7):2748--2761, July 2009.
[4]
Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences, 68(4):702--732, June 2004.
[5]
M. Bawa, A. Gionis, H. Garcia-Molina, and R. Motwani. The price of validity in dynamic networks. Journal of Computer and System Sciences, 73(3):245--264, May 2007.
[6]
A. Blokhuis. On the sperner capacity of the cyclic triangle. Journal of Algebraic Combinatorics, 2(2):123--124, June 1993.
[7]
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Transactions on Information Theory, 52(6):2508--2530, June 2006.
[8]
M. Braverman and A. Rao. Towards coding for maximum errors in interactive communication. In STOC, June 2011.
[9]
A. Chakrabarti and O. Regev. An optimal lower bound on the communication complexity of gap-hamming-distance. In STOC, June 2011.
[10]
A. Chandra, M. Furst, and R. Lipton. Multi-party protocols. In STOC, April 1983.
[11]
B. Chen, H. Yu, Y. Zhao, and P. B. Gibbons. The Cost of Fault Tolerance in Multi-Party Communication Complexity. Technical Report TRA5/12, School of Computing, National University of Singapore, May 2012. Also available at http://www.comp.nus.edu.sg/~yuhf/TRA5-12.pdf.
[12]
J. Chen and G. Pandurangan. Optimal gossip-based aggregate computation. In SPAA, June 2010.
[13]
J. Chen, G. Pandurangan, and D. Xu. Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis. In IPSN, April 2005.
[14]
J. Considine, F. Li, G. Kollios, and J. Byers. Approximate aggregation techniques for sensor databases. In ICDE, March 2004.
[15]
I. Eyal, I. Keidar, and R. Rom. LiMoSense - Live Monitoring in Dynamic Sensor Networks. In ALGOSENSORS, September 2011.
[16]
P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182--209, September 1985.
[17]
A. Giridhar and P. R. Kumar. Towards a theory of in-network computation in wireless sensor networks. IEEE Communications Magazine, 44(4):98--107, April 2006.
[18]
P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388--404, March 2000.
[19]
R. Impagliazzo and R. Williams. Communication complexity with synchronized clocks. In CCC, June 2010.
[20]
M. Jelasity, A. Montresor, and O. Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems, 23(3):219--252, August 2005.
[21]
P. Jesus, C. Baquero, and P. Almeida. Fault-tolerant aggregation by flow updating. In DAIS, June 2009.
[22]
S. Kashyap, S. Deb, K. Naidu, R. Rastogi, and A. Srinivasan. Efficient gossip-based aggregate computation. In PODS, June 2006.
[23]
D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In FOCS, October 2003.
[24]
E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1996.
[25]
D. Mosk-Aoyama and D. Shah. Computing separable functions via gossip. In PODC, July 2006.
[26]
S. Nath, P. Gibbons, S. Seshany, and Z. Anderson. Synopsis diffusion for robust aggregation in sensor networks. ACM Transactions on Sensor Networks, 4(2), March 2008.
[27]
S. Rajagopalan and L. Schulman. A coding theorem for distributed computation. In STOC, May 1994.
[28]
L. Schulman. Coding for interactive communication. IEEE Transactions on Information Theory, 42(6):1745--1756, 1996.
[29]
D. Woodruff. Optimal space lower bounds for all frequency moments. In SODA, January 2004.
[30]
H. Yu. Secure and highly-available aggregation queries in large-scale sensor networks via set sampling. Distributed Computing, 23(5):373--394, April 2011.
Index Terms
- The cost of fault tolerance in multi-party communication complexity
Recommendations
The Cost of Fault Tolerance in Multi-Party Communication Complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research, since the very beginning, has been to tolerate failures. It is thus ...
On the Hardness of Adding Nonmasking Fault Tolerance
This paper investigates the complexity of adding nonmasking fault tolerance, where a nonmasking fault-tolerant program guarantees recovery from states reached due to the occurrence of faults to states from where its specifications are satisfied. We first ...
Fault Tolerance in Multiprocessor Systems Without Dedicated Redundancy
An algorithm called RAFT (recursive algorithm for fault tolerance) for achieving fault tolerance in multiprocessor systems is described. Through the use of a combination of dynamic space- and time- redundancy techniques, RAFT achieves fault tolerance in ...
Comments
Information & Contributors
Information
Published In
July 2012
410 pages
ISBN:9781450314503
DOI:10.1145/2332432
- General Chair:
- Darek Kowalski,
- Program Chair:
- Alessandro Panconesi
Copyright © 2012 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 ACM 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: 16 July 2012
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 184Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Aug 2024
Other Metrics
Citations
Cited By
View all- Chen BYu HZhao YGibbons P(2014)The Cost of Fault Tolerance in Multi-Party Communication ComplexityJournal of the ACM10.1145/259763361:3(1-64)Online publication date: 2-Jun-2014
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in