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
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
The derivation of distributed termination detection algorithms from garbage collection schemes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Consistent global states of distributed systems: fundamental concepts and mechanisms
Distributed systems (2nd Ed.)
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Guest Editorial: Self-Reconfigurable Robots
Autonomous Robots
Illustrating the Use of Vector Clocks in Property Detection: An Example and a Counter-Example
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Efficient detection of a class of stable properties
Distributed Computing
Strong stable properties in distributed systems
Distributed Computing
Detecting Arbitrary Stable Properties Using Efficient Snapshots
IEEE Transactions on Software Engineering
Distributed Watchpoints: Debugging Large Modular Robot Systems
International Journal of Robotics Research
Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems
IEEE Distributed Systems Online
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
Detecting stable locality-aware predicates
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this article, we formalize locally distributed predicates, a concept previously introduced to address specific challenges associated with modular robotics and distributed debugging. A locally distributed predicate (LDP) is a novel construction for representing and detecting distributed properties in sparse-topology systems. Our previous work on LDPs presented empirical validation; here we show a formal model for two variants of the LDP algorithm, LDP-Basic and LDP-Snapshot, and establish performance bounds for these variants. We prove that LDP-Basic can detect strong stable predicates, that LDP-Snapshot can detect all stable predicates, and discuss their applicability to various distributed programming domains and to spatial computing in general. LDP detection in bounded-degree networks is shown to be scale-free, making the approach particularly attractive for specific topologies, even though LDPs are less efficient than snapshot algorithms in general distributed systems.