C. E. Jaekl. Event-Predicate Detection in the Debugging of Distributed Applications. Master's thesis, University of Waterloo, Waterloo, Ontario, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Offline Algorithm for Dimension-Bound Analysis - Ward (1999) (Correct)
....aid, for any non trivial computation it is not possible to display the whole partial order. As a result, distributed debugging systems such as POET [13] need to provide much more than just a drawing. It is necessary to intelligently scroll around the display [20] search for interesting patterns [10], compute differences between subsequent executions of a computation [8] detect race conditions [23] determine appropriate abstractions to provide higher level views [12] and so on. To perform these operations it is frequently necessary to determine event precedence. That is, given two events, ....
C. E. Jaekl. Event-Predicate Detection in the Debugging of Distributed Applications. Master's thesis, University of Waterloo, Waterloo, Ontario, 1997.
Event-Predicate Detection in the Monitoring of Distributed.. - Fox (1998) (Correct)
....a huge amount of information. 1.3 Thesis Overview This thesis describes the design and implementation of an online monitor used to detect the occurrence of a class of event predicates in distributed applications. A predicate definition langauge is developed based on that presented by Jaekl [18] with extensions to increase its expressivity, and aid the detection of predicates by an online algorithm. The thesis is organized as follows. Chapter 2 discusses the ordering of primitive events in distributed systems and applications and the vector timestamps used to describe a logical ordering ....
....compound events can be formed using previously defined compound events. The collection of primitive events that satisfy an event predicate form a hierarchy of compound events according to the structure of the predicate. In discussing primitive events and compound events, the convention of Jaekl [18] is followed, in which lower case letters are used to denote primitive events and capital letters denote compound events. Consider the example specifying that one set of events must occur before another. a b c) d e) The operator represents conjunction; the events on both sides of the ....
[Article contains additional citation context not shown here]
Christian E. Jaekl. Event-predicate detection in the debugging of distributed applications. Master's thesis, University of Waterloo, Department of Computer Science, Waterloo, Ontario, Canada, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC