Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Process and event abstraction for debugging distributed programs
Process and event abstraction for debugging distributed programs
Vector time and causality among abstract events in distributed computations
Distributed Computing
A mechanism for visualizing TCP-socket interactions
CASCON '05 Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research
Pattern rewriting for efficient search in partial-order event data
CASCON '07 Proceedings of the 2007 conference of the center for advanced studies on Collaborative research
Fast convex closure for efficient predicate detection
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
When working with large collections of event data from a distributed application, efficient mechanisms for locating patterns of interest are of obvious practical importance. Complex patterns can most naturally be built by combining simpler patterns, but searching for such hierarchical patterns in partially ordered event data presents significant challenges. In this paper, we describe the general problem and our approach to solving it, with particular emphasis on an algorithm for constructing an appropriate closure of the events matching a sub-pattern, so that it can be used as a component at the next level of pattern matching. The work described is based on earlier work performed in the context of POET (the Partial-Order Event Tracer) from the University of Waterloo but was implemented as an Eclipse plug-in.