Abstract
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.
- Ashley-Rollman, M., De Rosa, M., Srinivasa, S., Pillai, P., Goldstein, S., and Campbell, J. 2007. Declarative programming for modular robots. In Proceedings of the IEEE International Conference on Robots and Systems (IROS’07). IEEE, Los Alamitos, CA.Google Scholar
- Babao, Ö., Marzullo, K., and Marzullo, K. 1993. Consistent global states of distributed systems: Fundamental concepts and mechanisms. In Distributed Systems, Addison-Wesley, Reading, MA, 55--96. Google Scholar
Digital Library
- Baldoni, R. and Raynal, M. 2002. Fundamentals of distributed computing: A practical tour of vector clock systems. In Distributed Systems Online. Google Scholar
Digital Library
- Butler, Z., Kotay, K., Rus, D., and Tomita, K. 2002. Generic decentralized control for a class of self-reconfigurable robots. In Proceedings of the International Conference on Robotics and Automation (ICRA). IEEE, Los Alamitos, CA, 809--816.Google Scholar
- Chandy, K. M. and Lamport, L. 1985. Distributed snapshots: Determining global states in distributed systems. ACM Trans. Comput. Syst. 3, 1, 63--75. Google Scholar
Digital Library
- Cooper, R. and Marzullo, K. 1991. Consistent detection of global predicates. In ACM SIGPLAN Not. 26, 167--174. Google Scholar
Digital Library
- Critchlow, C. and Taylor, K. 1990. The inhibition spectrum and the achievement of causal consistency. In Proceedings of the 9th annual ACM symposium on Principles of Distributed Computing (PODC’90). ACM, New York, 31--42. Google Scholar
Digital Library
- De Rosa, M., Goldstein, S. C., Lee, P., Campbell, J., and Pillai, P. 2008. Distributed watchpoints: Debugging large modular robotic systems. Int. J. Robotics Res. 27, 3 (Special Issue on Modular Robotics). Google Scholar
Digital Library
- De Rosa, M., Goldstein, S. C., Lee, P., Pillai, P., and Campbell, J. 2009. A tale of two planners: Modular robotic planning with LDP. In Proceedings of the International Conference on Intelligent Robots and Systems (IROS). IEEE, Los Alamitos, CA. Google Scholar
Digital Library
- De Rosa, M., Goldstein, S. C., Lee, P., Pillai, P. S., and Campbell, J. 2008. Programming modular robots with locally distributed predicates. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA’08). IEEE, Los Alamitos, CA.Google Scholar
- Fidge, C. 1991. Logical time in distributed computing systems. Computer 24, 8, 28--33. Google Scholar
Digital Library
- Karp, B. and Kung, H. T. 2000. Greedy perimeter state routing for wireless networks. In Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’00). ACM, New York, 243--254. Google Scholar
Digital Library
- Kshemkalyani, A. and Wu, B. 2007. Detecting arbitrary stable properties using efficient snap-shots. IEEE Trans. Softw. Eng. 33, 5, 330--346. Google Scholar
Digital Library
- Kshemkalyani, A. D., Raynal, M., and Singhal, M. 1995. An introduction to snapshot algorithms in distributed computing. Distrib. Syst. Eng. 2, 4, 224--233.Google Scholar
Cross Ref
- Lai, T. H. and Yang, T. H. 1987. On distributed snapshots. Inf. Process. Lett. 25, 3, 153--158. Google Scholar
Digital Library
- Lamport, L. 1978. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 7, 558--565. Google Scholar
Digital Library
- Levis, P., Madden, S., Polastre, J., Szewczyk, R., Whitehouse, K., Woo, A., Gay, D., Hill, J., Welsh, M., Brewer, E., and Culler, D. 2004. Tinyos: An operating system for sensor networks. In Ambient Intelligence, Springer Verlag.Google Scholar
- Marzullo, K. and Sabel, L. S. 1994. Efficient detection of a class of stable properties. Distrib. Comput. 8, 2, 81--91. Google Scholar
Digital Library
- Obermarck, R. 1982. Distributed deadlock detection algorithm. ACM Trans. Datab. Syst. 7, 2, 187--208. Google Scholar
Digital Library
- Raynal, M. 1999. Illustrating the use of vector clocks in property detection: An example and a counter-example. In Proceedings of the 5th International Euro-Par Conference on Parallel Processing (Euro-Par’99). Springer, Berlin, 806--814. Google Scholar
Digital Library
- Rus, D. and Chirikjian, G., (eds.) 2001. Special issue on self-reconfiguring robots. Autonomous Robotics 10, 1. Google Scholar
Digital Library
- Schiper, A. and Sandoz, A. 1994. Strong stable properties in distributed systems. Distrib. Comput. 8, 2, 93--103. Google Scholar
Digital Library
- Tel, G. and Mattern, F. 1993. The derivation of distributed termination detection algorithms from garbage collection schemes. In ACM Trans. Program. Lang. Syst. 15, 1--35. Google Scholar
Digital Library
- Venkatesan, S. 1989. Message-optimal incremental snapshots. In Proceedings of the 9th International Conference on Distributed Computing Systems. IEEE, Los Alamitos, CA, 53--60.Google Scholar
Cross Ref
Index Terms
Detecting Locally Distributed Predicates
Recommendations
Distributed algorithm to detect strong conjunctive predicates
This paper presents an on-line distributed algorithm for detection of Definitely(φ) for the class of conjunctive global predicates. The only known algorithm for detection of Definitely(φ) uses a centralized approach. A method for decentralizing the ...






Comments