Abstract
This paper discusses detection of global predicates in a distributed program. Earlier algorithms for detection of global predicates proposed by Chandy and Lamport work only for stable predicates. Our algorithms detect even unstable predicates without excessive overhead. The predicates are specified using a logic described formally in this paper. We require the predicates to be conjunction, disjunction or linking of local predicates. The message complexity of our algorithm is bounded by the number of messages used by the program. The main application of our results are in debugging and testing of distributed programs. We have incorporated our algorithms in a distributed debugger that runs on a cluster of Sun workstations.
Research supported in part by NSF Grant CCR 9110605, Navy Grant N00039-88-C-0082, TRW faculty assistantship award, and IBM Agreement 153.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Bouge, “Repeated Snapshots in Distributed Systems with synchronous communication and their implementation in CSP”, Theoretical Computer Science, 49: 145–169, 1987.
K.M. Chandy and L. Lamport, “Distributed Snapshots: Determining Global States of Distributed Systems”, ACM TOCS, February 1985, pp. 63–75.
R. Cooper, K. Marzullo, “Consistent Detection of Global Predicates”, Proc. ACM Workshop on Parallel and Dist. Debugging, 1991, 163–173.
C. Fidge, “Partial Orders for Parallel Debugging”, Proc. of the ACM Workshop on Parallel and Dist. Debugging, 1988, pp. 130–140.
V. K. Garg, “Some Optimal Algorithms for Decomposed Partially Ordered Sets,” to appear Information Processing Letters.
V. K. Garg, M.T. Raghunath “Concurrent Regular Expressions and their Relationship to Petri Net Languages,” Theoretical Computer Science 96 (1992) pp 285–304.
L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System”, Communications of the ACM, July, 1978, pp. 558–565.
F. Mattern, “Virtual time and global states of distributed systems”, Parallel and Distributed Algorithms: Proceedings of the International Workshop on Parallel and Distributed Algorithms, Elsevier Science Publishers B. V., 1989, pp. 215–226.
B. P. Miller and J. Choi, “Breakpoints and Halting in Distributed Programs”, Proc. of the 8-th Intl Conf. on Distributed Computing Systems, San Jose, CA, 1988, pp 316–323.
M. Spezialetti and P. Kearns, “Efficient Distributed Snapshots”, Proc. of the 6-th Intl Conf. on Distributed Computing Systems, 1986, pp. 382–388.
B. Waldecker, “Detection of Unstable Predicates in Debugging Distributed Programs”, PhD. Dissertation, ECE Dept., Univ. of Texas at Austin, 1991.
B. Waldecker, V. K. Garg, “Unstable Predicate Detection in Distributed Programs,” Proc. 3rd IEEE Symp. on Parallel and Dist. Processing, Dec 1991, pp 692–699.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, V.K., Waldecker, B. (1992). Detection of unstable predicates in distributed programs. In: Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1992. Lecture Notes in Computer Science, vol 652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56287-7_110
Download citation
DOI: https://doi.org/10.1007/3-540-56287-7_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56287-0
Online ISBN: 978-3-540-47507-1
eBook Packages: Springer Book Archive