Issue No. 07 - July (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.508247
<p><b>Abstract</b>—Recently published algorithms for matching concurrent sets of events have the problem of unbounded message queue growth if events arrive in an undesirable order. This paper presents some algorithms that mitigate this problem by examining events waiting to be processed and removing those that cannot be part of a concurrent set.</p>
Event predicate, concurrent events, distributed debugging, distributed algorithm, causal dependency.
H. Chiou and W. Korfhage, "Enhancing Distributed Event Predicate Detection Algorithms," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 673-676, 1996.