Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Lamport (1978)
Time, clocks, and the ordering of events in a distributed systemCommun. ACM, 21
V. Garg, B. Waldecker (1996)
Detection of Strong Unstable Predicates in Distributed ProgramsIEEE Trans. Parallel Distributed Syst., 7
B. Miller, Jong-Deok Choi (1988)
Breakpoints and halting in distributed programs[1988] Proceedings. The 8th International Conference on Distributed
Madalene Spezialetti, P. Kearns (1986)
Efficient Distributed Snapshots
Bernadette Charron-Bost, C. Delporte-Gallet, H. Fauconnier (1995)
Local and temporal predicates in distributed systemsACM Trans. Program. Lang. Syst., 17
R. Cooper, K. Marzullo (1991)
Consistent detection of global predicates
R. Jégou, Raoul Medina, Lhouari Nourine (1995)
Linear Space Algorithm for On-line Detection of Global Predicates
S. Stoller, F. Schneider (1995)
Faster Possibility Detection by Combining Two Approaches
E. Fromentin, M. Raynal, V. Garg, Alexander Tomlinson (1994)
On the Fly Testing of Regular Patterns in Distributed Computations1994 Internatonal Conference on Parallel Processing Vol. 2, 2
K. Marzullo, G. Neiger (1991)
Detection of Global State Predicates
O. Babaoglu, M. Raynal (1995)
Specification and Verification of Behavioral Patterns in Distributed Computations
Alexander Tomlinson, V. Garg (1993)
Detecting relational global predicates in distributed systems
L. Lamport, M. Chandy (1985)
Distributed snapshots: determining global states of distributed systemsACM Trans. Comput. Syst., 3
David Johnson, W. Zwaenepoel (1988)
Recovery in Distributed Systems Using Optimistic Message Logging and CheckpointingJ. Algorithms, 11
V. Garg (1996)
Observation of Global Properties in Distributed Systems
L. Bougé (1987)
Repeated Snapshots in Distributed Systems with Synchronous Communications and their Implementation in CSPTheor. Comput. Sci., 49
V. Garg, B. Waldecker (1994)
Detection of Weak Unstable Predicates in Distributed ProgramsIEEE Trans. Parallel Distributed Syst., 5
M. Hurfin, N. Plouzeau, M. Raynal (1993)
Detecting atomic sequences of predicates in distributed computations
(1994)
Detecting causal relations hips in distributed computations: In search of the holy grail. Distributed Computing
O. Babaoglu, K. Marzullo (1993)
Consistent global states of distributed systems: fundamental concepts and mechanisms
(1989)
Virtual time and global states of distribut ed systems. InParallel and Distributed Algorithms: Proceedings of the Internatio nal Workshop on Parallel and Distributed Algorithms
Ratnesh Kumar, V. Garg (1994)
Modeling and Control of Logical Discrete Event Systems
Proceedings of the 28th Annual Hawaii International Conference on System Sciences- 1995 Detecting Conjunctive Channel Predicates in a Distributed Programming Environment
B. Groselj (1993)
Bounded and minimum global snapshotsIEEE Parallel & Distributed Technology: Systems & Applications, 1
(1991)
Consistent detection of globa predicates. InProc. of the ACM/ONR Workshop on Parallel and Distributed Debuggi n
V. Garg, B. Waldecker (1992)
Detection of Unstable Predicates in Distributed Programs
Summary. We show that the problem of predicate detection in distributed systems is NP-complete. In the past, efficient algorithms have been developed for special classes of predicates such as stable predicates, observer independent predicates, and conjunctive predicates. We introduce a class of predicates, semi-linear predicates, which properly contains all of the above classes. We first discuss stable, observer independent and semi-linear classes of predicates and their relationships with each other. We also study closure properties of these classes with respect to conjunction and disjunction. Finally, we discuss algorithms for detection of predicates in these classes. We provide a non-deterministic detection algorithm for each class of predicate. We show that each class can be equivalently characterized by the degree of non-determinism present in the algorithm. Stable predicates are defined as those that can be detected by an algorithm with the most non-determinism. All other classes can be derived by appropriately constraining the non-determinism in this algorithm.
Distributed Computing – Springer Journals
Published: Oct 1, 1998
Keywords: Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.