STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilizing depth-first search
Information Processing Letters
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The local detection paradigm and its applications to self-stabilization
Theoretical Computer Science
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
The fault span of crash failures
Journal of the ACM (JACM)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
SIAM Journal on Computing
IEEE Transactions on Computers
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Self-stabilizing multicast protocols for ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
A Distributed Algorithm for Constructing Minimal Spanning Trees
IEEE Transactions on Software Engineering
A sub-linear time distributed algorithm for minimum-weight spanning trees
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Self-Stabilizing Leader Election in Optimal Space
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A new self-stabilizing minimum spanning tree construction with loop-free property
DISC'09 Proceedings of the 23rd international conference on Distributed computing
DISC'10 Proceedings of the 24th international conference on Distributed computing
Slf-stabiliezing leader election in dynamic networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Hi-index | 0.00 |
This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of algorithms. In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes it for improving the memory size complexity, while obtaining time efficiency too. As a result, we show that optimizing the memory size carries at most a small cost in terms of time, in the context of Minimum Spanning Tree (MST). That is, we present algorithms that are both time and space efficient for constructing an MST, for verifying it, and for detecting the location of the faults. This involves several steps that may be considered contributions in themselves. First, we generalize the notion of local proofs, trading off the locality (or, really, the time complexity) for memory efficiency. This adds a dimension to the study of distributed local proofs, that has been gaining attention recently. Second, as opposed to previous studies that presented only the labels verification part of a proof labeling schemes, we present here also a space and time efficient distributed self stabilizing marker algorithm to generates those labels. This presents proof labeling schemes as an algorithmic tool. Finally, we show how to enhance a known transformer that makes input/output algorithms self stabilizing. It now takes as input an efficient construction algorithm and an efficient self stabilizing proof labeling scheme, and produces an efficient self stabilizing algorithm. When used for MST, the transformer produces a memory optimal (i.e., O(log n) bits per node) self stabilizing algorithm, whose time complexity, namely, O(n), is significantly better even than that of previous algorithms that where not space optimal. (The time complexity of previous MST algorithms that used ©(log2 n) memory bits per node was O(n2), and the time for optimal space algorithms was O(n|E|).) Our MST algorithm also has the important property that, if faults occur after the construction ended, then they are detected by some nodes within O(log2 n) time in synchronous networks, or within O(? log2 n) time in asynchronous ones. This property is inherited from the specific proof labeling scheme we construct. It answers an open problem posed by Awerbuch and Varghese (FOCS 1991). We also show that ©(log n) time is necessary if the memory size is restricted to O(log n) bits, even in synchronous networks. Another property is that if f faults occurred, then, within the required detection time above, they are detected by some node in the O(f log n) locality of each of the faults. We also show how to improve the above detection time and locality, at the expense of some increase in the memory.