An efficient implementation of vector clocks
Information Processing Letters
On-the-fly analysis of distributed computations
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Consistent Global Checkpoints that Contain a Given Set of Local Checkpoints
IEEE Transactions on Computers
An adaptive causal ordering algorithm suited to mobile computing environments
Journal of Parallel and Distributed Computing
Shared global states in distributed computations
Journal of Computer and System Sciences
Efficient Distributed Detection of Conjunctions of Local Predicates
IEEE Transactions on Software Engineering
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Principles of Distributed Systems
Principles of Distributed Systems
Consistency Issues in Distributed Checkpoints
IEEE Transactions on Software Engineering
Reachability Analysis on Distributed Executions
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Communication-based prevention of useless checkpoints in distributed computations
Distributed Computing
Efficient detection of a class of stable properties
Distributed Computing
Neural, Parallel & Scientific Computations
An approach to feature location in distributed systems
Journal of Systems and Software
| Hi-index | 0.00 |
A distributed computation is usually modeled as a partially ordered set of relevant events (the relevant events are a subset of the primitive events produced by the computation). An important causality-related distributed computing problem, that we call the Immediate Predecessors Tracking (IPT) problem, consists in associating with each relevant event, on the fly and without using additional control messages, the set of relevant events that are its immediate predecessors in the partial order. So, IPT is the on-the-fly computation of the transitive reduction (i.e., Hasse diagram) of the causality relation defined by a distributed computation. This paper addresses the IPT problem: it presents a family of protocols that provides each relevant event with a timestamp that exactly identifies its immediate predecessors. The family is defined by a general condition that allows application messages to piggyback control information whose size can be smaller than $n$ (the number of processes). In that sense, this family defines message size-efficient IPT protocols. According to the way the general condition is implemented, different IPT protocols can be obtained. Two of them are exhibited.