The Community for Technology Leaders
14th International Conference on Distributed Computing Systems (1994)
Pozman, Poland
June 21, 1994 to June 24, 1994
ISBN: 0-8186-5840-1
pp: 642-649
Hsien-Kuang Chiou , Dept. of Comput. Sci., Polytechnic Univ., Brooklyn, NY, USA
W. Korfhage , Dept. of Comput. Sci., Polytechnic Univ., Brooklyn, NY, USA
ABSTRACT
Detection of global event predicates is an important issue for distributed systems, particularly for debugging and monitoring of such systems. The paper defines event normal form (ENF) event predicates, and two online algorithms to detect the first occurrence of such predicates. These algorithms differ in the technique used to match concurrent groups of events. The first builds and searches a tree of a possible matches. The second algorithm achieves the same result as the first, but needs only a single node of the tree at any time, resulting in better space and time complexity. We outline correctness proofs, and provide performance measurements from an implementation.<>
INDEX TERMS
distributed algorithms, program debugging, program verification, computational complexity
CITATION

Hsien-Kuang Chiou and W. Korfhage, "Efficient global event predicate detection," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 642-649.
doi:10.1109/ICDCS.1994.302482
94 ms
(Ver 3.3 (11022016))