๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Detecting ENF Event Predicates in Distributed Systems

โœ Scribed by Hsien-Kuang Chiou; Willard Korfhage

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
294 KB
Volume
44
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

Detection of global event predicates is an important issue for distributed systems, particularly for debugging and monitoring of such systems. This paper defines event normal form (ENF) event predicates, and then provides an on-line distributed algorithm to detect the first occurrence of such a predicate. We extend the algorithm to detect parameterized predicates, and develop a multithreaded matcher that will detect multiple instances of an ENF predicate. Measurements show that the algorithm is very fast, taking 10-20 ยตs to process each event message, depending upon the predicate complexity. We believe that this combination of speed and flexibility can make the algorithm very useful for on-line monitoring of distributed systems.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Detection of Channel Predicate
Efficient Detection of Channel Predicates in Distributed Systems
โœ V.K. Garg; C.M. Chase; Richard Kilgore; J.Roger Mitchell ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 443 KB

This paper discusses efficient detection of global predicates in a distributed program. Previous work in this area required predicates to be specified as a conjunction of predicates defined on individual processes. Many properties in distributed systems, however, use the state of channels, such as "