Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Distributed systems (3rd ed.): concepts and design
Distributed systems (3rd ed.): concepts and design
Software reliability methods
A prototype debugger for Hermes
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
A scalable partial-order data structure for distributed-system observation
A scalable partial-order data structure for distributed-system observation
Specifying and locating hierarchical patterns in event data
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Scrolling partially ordered event displays
Journal of Parallel and 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
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 sets of partial-order event data, typically collected from the execution of a distributed application, it is often desirable to search for specific patterns of events within this data. Such pattern matching must account for attributes on individual events as well as relationships between events and sets of events. In this paper, we propose a method for transforming complex hierarchical patterns into simpler, flattened patterns. This new way of expressing patterns eliminates the need for a costly convex-closure operation at each step in the search process. It also facilitates further optimizations such as re-ordering of pattern elements.