Information Processing Letters
The inhibition spectrum and the achievement of causal consistency
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Detection of Strong Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Detection of Weak Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
The Role of Inhibition on Asynchronous Consistent-Cut Protocols
Proceedings of the 3rd International Workshop on Distributed Algorithms
Observing Global States of Asynchronous Distributed Applications
Proceedings of the 3rd International Workshop on Distributed Algorithms
Efficient detection of a class of stable properties
Distributed Computing
Strong stable properties in distributed systems
Distributed Computing
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
Detecting Arbitrary Stable Properties Using Efficient Snapshots
IEEE Transactions on Software Engineering
Protocols for Deadlock Detection in Distributed Database Systems
IEEE Transactions on Software Engineering
Distributed Watchpoints: Debugging Large Modular Robot Systems
International Journal of Robotics Research
Distributed Computing: Principles, Algorithms, and Systems
Distributed Computing: Principles, Algorithms, and Systems
A tale of two planners: modular robotic planning with LDP
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Efficient Algorithms for Global Snapshots in Large Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Detecting Locally Distributed Predicates
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Monitoring stable properties in dynamic peer-to-peer distributed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Stable predicate detection in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Detecting Tree Distributed Predicates
ICPPW '12 Proceedings of the 2012 41st International Conference on Parallel Processing Workshops
Flexible Symmetrical Global-Snapshot Algorithms for Large-Scale Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In a large-scale locality-driven network such as in modular robotics and wireless sensor networks, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We define locality-aware predicates (LAP) that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within a breadth-first search tree (BFST) of height k rooted at the initiator process. Although a locality-aware predicate specifies a predicate only within a local area, observing the area consistently requires considering the entire system in a consistent manner. This raises the challenge of making the complexities of the corresponding predicate detection algorithms scale-free, i.e., independent of the size of the system. Since all existing algorithms for getting a consistent view of the system require either a global snapshot of the entire system or vector clocks of the size of the system, a new solution is needed. We focus on stable LAP, which are those LAP that remain true once they become true. We propose a scale-free algorithm to detect stable LAP within a k-height BFST. Our algorithm can detect both stable conjunctive LAP and stable relational LAP. In the process of designing our algorithm, we also propose the first distributed algorithm for building a BFST within an area of interest in a graph, and the first distributed algorithm for recording a consistent sub-cut within the area of interest. This paper demonstrates that LAPs are a natural fit for detecting distributed properties in large-scale distributed systems, and stable LAPs can be practically detected at low cost.