TY - GEN

T1 - Brief announcement

T2 - 35th ACM Symposium on Principles of Distributed Computing, PODC 2016

AU - Baruch, Mor

AU - Ostrovsky, Rafail

AU - Rosenbaum, Will

N1 - Publisher Copyright:
© 2016 ACM.

PY - 2016/7/25

Y1 - 2016/7/25

N2 - 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) [12], locally checkable proofs (LCP) [10], and non-deterministic local decision (NLD) [8]. In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa [11] 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 tradeo s 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 spacetime 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.

AB - 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) [12], locally checkable proofs (LCP) [10], and non-deterministic local decision (NLD) [8]. In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa [11] 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 tradeo s 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 spacetime 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.

KW - Distributed algorithms

KW - Proof-labeling schemes

KW - Space-time tradeoffs

UR - http://www.scopus.com/inward/record.url?scp=84984688992&partnerID=8YFLogxK

U2 - 10.1145/2933057.2933071

DO - 10.1145/2933057.2933071

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84984688992

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 357

EP - 359

BT - PODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

Y2 - 25 July 2016 through 28 July 2016

ER -