Time-space trade-offs in population protocols
Name
Rivest_Time-space.pdf
Size
452.51 KB
Format
Adobe PDF
Checksum (MD5)
279272db31a3cc740efd757b05e1b67c
Author(s)
Alistarh, Dan
Aspnes, James
Eisenstat, David
Gelashvili, Rati
Rivest, Ronald L
Date Issued
2017
Journal
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '17)
Publisher
Society for Industrial and Applied Mathematics (SIAM)
Citation
Alistarh, Dan et al. "Time-space trade-offs in population protocols." Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '17), January 2017, Barcelona, Spain, Philip N. Klein, editor, Society for Industrial and Applied Mathematics (SIAM), 2017
Version
Author's final manuscript
Abstract
Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires convergence to a single agent in a special "leader" state), and majority (in which agents must converge to a decision as to which of two possible initial states had higher initial count). Known results point towards an inherent trade-off between the time complexity of such algorithms, and the space complexity, i.e. size of the memory available to each agent.
In this paper, we explore this trade-off and provide new upper and lower bounds for majority and leader election. First, we prove a unified lower bound, which relates the space available per node with the time complexity achievable by a protocol: for instance, our result implies that any protocol solving either of these tasks for n agents using O(log log n) states must take Ω(n/polylogn) expected time. This is the first result to characterize time complexity for protocols which employ super-constant number of states per node, and proves that fast, poly-logarithmic running times require protocols to have relatively large space costs.
On the positive side, we give algorithms showing that fast, poly-logarithmic convergence time can be achieved using O(log²n) space per node, in the case of both tasks. Overall, our results highlight a time complexity separation between O (log log n) and Θ(log²n) state space size for both majority and leader election in population protocols, and introduce new techniques, which should be applicable more broadly.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
http://dl.acm.org/citation.cfm?id=3039686.3039855
