Mor Baruch
ABSTRACT
Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS), locally checkable proofs (LCP), and non-deterministic local decision (NLD). In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa presented a proof-labeling scheme for MST, with poly-logarithmic verification time, and logarithmic memory at each vertex. In this paper we introduce the notion of a t-PLS, which allows the verification procedure to run for super-constant time. Our work analyzes the tradeoffs of t-PLS between time, label size, message length, and computation space. We construct a universal t-PLS and prove that it uses the same amount of total communication as a known one-round universal PLS, and t factor smaller labels. In addition, we provide a general technique to prove lower bounds for space- time tradeoffs of t-PLS. We use this technique to show an optimal tradeoff for testing that a network is acyclic (cycle free). Our optimal t-PLS for acyclicity uses label size and computation space O((log n)/t). We further describe a recursive O(log* n) space verifier for acyclicity which does not assume previous knowledge of the run-time t.
- Y. Afek, S. Kutten, and M. Yung. The local detection paradigm and its application to self-stabilization. Theor. Comput. Sci., 186(1--2):199--229, 1997. Google Scholar
Digital Library
- B. Awerbuch and R. Ostrovsky. Memory-efficient and self-stabilizing network reset (extended abstract). In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '94, pages 254--263, New York, NY, USA, 1994. ACM. Google ScholarDigital Library
- B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local checking and correction. In 32nd Symposium on Foundations of Computer Science (FOCS), pages 268--277. IEEE, 1991. Google ScholarDigital Library
- M. Baruch, P. Fraigniaud, and B. Patt-Shamir. Randomized proof-labeling schemes. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC, pages 315--324, 2015. Google ScholarDigital Library
- M. Baruch, R. Ostrovsky, and W. Rosenbaum. Space-time tradeoffs for local verification. Manuscript, available at www.arxiv.org, 2016.Google Scholar
- L. Blin, P. Fraigniaud, and B. Patt-Shamir. On proof-labeling schemes versus silent self-stabilizing algorithms. In 16th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, pages 18--32. Springer, 2014.Google ScholarCross Ref
- A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. SIAM J. Comput., 41(5):1235--1265, 2012.Google Scholar
- P. Fraigniaud, A. Korman, and D. Peleg. Towards a complexity theory for local distributed computing. J. ACM, 60(5):35, 2013. Google ScholarDigital Library
- P. Fraigniaud, S. Rajsbaum, and C. Travers. Locality and checkability in wait-free computing. Distributed Computing, 26(4):223--242, 2013.Google ScholarDigital Library
- M. Göös and J. Suomela. Locally checkable proofs. In 30th ACM Symp. on Principles of Distributed Computing (PODC), pages 159--168, 2011. Google ScholarDigital Library
- A. Korman, S. Kutten, and T. Masuzawa. Fast and compact self stabilizing verification, computation, and fault detection of an MST. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 311--320, 2011. Google ScholarDigital Library
- A. Korman, S. Kutten, and D. Peleg. Proof labeling schemes. Distributed Computing, 22(4):215--233, 2010.Google ScholarDigital Library
Index Terms
- Brief Announcement: Space-Time Tradeoffs for Distributed Verification
Recommendations
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingOver the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingWe study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-...
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingWe give a randomness-efficient Massively Parallel Computation (MPC) algorithm for deciding whether an undirected graph is connected. For Connectivity on n-vertex, m-edge graphs whose components have diameter at most D = 2o(log n/ log log n), our ...
Comments