Vector time and causality among abstract events in distributed computations

Authors:
Twan Basten;Thomas Kunz;James P. Black;Michael H. Coffin;David J. Taylor
Affiliations:
Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Venue:
Distributed Computing
Year:
1997

Citing 23
Cited 7

Global events and global breakpoints in distributed systems

Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Partial orders for parallel debugging

PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
Logical Time in Distributed Computing Systems

Computer - Distributed computing systems: separate resources acting as one
Concerning the size of logical clocks in distributed systems

Information Processing Letters
Consistent detection of global predicates

PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Lightweight causal and atomic group multicast

ACM Transactions on Computer Systems (TOCS)
Local states in distributed computations: a few relations and formulas

ACM SIGOPS Operating Systems Review
Debugging heterogeneous distributed systems using event-based models of behavior

ACM Transactions on Computer Systems (TOCS)
Consistent global states of distributed systems: fundamental concepts and mechanisms

Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Using Visualization Tools to Understand Concurrency

IEEE Software
Checkpointing for Distributed Databases: Starting from the Basics

IEEE Transactions on Parallel and Distributed Systems
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory

Proceedings of the 3rd International Workshop on Distributed Algorithms
Breakpoints and Time in Distributed Computations

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Visualizing abstract events

CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
A scalable, visual interface for debugging with event-based behavioral abstraction

FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Characterizing and Detecting the Set of Global States Seen by all Observers of a Distributed Computation

ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Process and event abstraction for debugging distributed programs

Process and event abstraction for debugging distributed programs
Poet: Target-System-Independent Visualizations of Complex Distributed Executions

HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
A prototype debugger for Hermes

CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Synchronous, asynchronous, and causally ordered communication

Distributed Computing
Efficient detection of a class of stable properties

Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail

Distributed Computing

High-Level Views of Distributed Executions: Convex Abstract Events

Automated Software Engineering
Concurrent single stepping in event-visualization tools

Cluster Computing
Auditing Causal Relationships of Group Multicast Communications in Group-Oriented Distributed Systems

The Journal of Supercomputing
Visualizing Mobile Agent Executions

MATA '00 Proceedings of the Second International Workshop on Mobile Agents for Telecommunication Applications
Guaranteed Mutually Consistent Checkpointing in Distributed Computations

ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

An important problem in analyzing distributed computations is the amount of information. In event-based models, even for simple applications, the number of events is large and the causal structure is complex. Event abstraction can be used to reduce the apparent complexity of a distributed computation. This paper discusses one important aspect of event abstraction: causality among abstract events. Following Lamport [24], two causality relations are defined on abstract events, called weak and strong precedence. A general theoretical framework based on logical vector time is developed in which several meaningful timestamps for abstract events are derived. These timestamps can be used to efficiently determine causal relationships between arbitrary abstract events. The class of convex abstract events is identified as a subclass of abstract events that is general enough to be widely applicable and restricted enough to simplify time-stamping schemes used for characterizing weak precedence. We explain why such a simplification seems not possible for strong precedence.