Detection of strong unstable predicates in distributed programs

This paper discusses detection of global predicates in a distributed program. A run of a distributed program results in a set of sequential traces, one for each process. These traces may be combined to form many global sequences consistent with the single run of the program. A strong global predicat...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 1996-12, Vol.7 (12), p.1323-1333
Main Authors: Garg, V.K., Waldecker, B.
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Computer Society
Computer systems and distributed systems. User interface
Debugging
Distributed algorithms
Distributed computing
Exact sciences and technology
Learning and adaptive systems
Monitoring
Safety
Senior members
Software
Software engineering
State-space methods
Testing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper discusses detection of global predicates in a distributed program. A run of a distributed program results in a set of sequential traces, one for each process. These traces may be combined to form many global sequences consistent with the single run of the program. A strong global predicate is true in a run if it is true for all global sequences consistent with the run. We present algorithms which detect if the given strong global predicate became true in a run of a distributed program. Our algorithms can be executed on line as well as off line. Moreover, our algorithms do not assume that underlying channels satisfy FIFO ordering.
ISSN:1045-9219
1558-2183
DOI:10.1109/71.553309