Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Software—Practice & Experience
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
High-Level Views of Distributed Executions: Convex Abstract Events
Automated Software Engineering
Visualizing the Performance of Parallel Programs
IEEE Software
The PVM 3.4 Tracing Facility and XPVM 1.1
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
A scalable partial-order data structure for distributed-system observation
A scalable partial-order data structure for distributed-system observation
Vector time and causality among abstract events in distributed computations
Distributed Computing
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
| Hi-index | 0.00 |
Understanding the partial-order relationship between events is critical to understand the behaviour of a distributed or parallel application. Many problems need to be solved in order to provide an accurate and useful display of a large partial order, such as will occur during the execution of any non-trivial application. A display will most likely resemble a process-time diagram, but the ''time'' axis does not have a fixed interpretation. Flexibility in positioning events along this axis allows more-useful displays to be created, but also greatly complicates scrolling through the event history. This paper first discusses the properties that are arguably desirable for such scrolling and then presents an algorithm that provides scrolling with those properties.