Predicate calculus and program semantics
Predicate calculus and program semantics
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Crash failures can drive protocols to arbitrary states
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Component Based Design of Multitolerant Systems
IEEE Transactions on Software Engineering
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Lock-based self-stabilizing distributed mutual exclusion algorithms
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Distributed algorithms for detecting conjunctive predicates
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Stabilizing Causal Deterministic Merge
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Self-Stabilizing Real-Time OPS5 Production Systems
IEEE Transactions on Knowledge and Data Engineering
Journal of Parallel and Distributed Computing
Stabilizing causal deterministic merge
Journal of High Speed Networks - Self-Stabilizing Systems, Part 2
Neural, Parallel & Scientific Computations
Efficient dependency tracking for relevant events in concurrent systems
Distributed Computing
An approach to feature location in distributed systems
Journal of Systems and Software
When consensus meets self-stabilization
Journal of Computer and System Sciences
When consensus meets self-stabilization
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Hi-index | 0.00 |
Vector clocks (VC) are an inherent component of a rich class of distributed applications. In this paper, we consider the problem of realistic —more specifically, bounded-space and fault-tolerant— implementation of these client applications. To this end, we generalize the notion of VC to resettable vector clocks (RVC), and provide a realistic implementation of RVC. Further, we identify an interface contract under which our RVC implementation can be substituted for VC in client applications, without affecting the client's correctness. Based on such substitution, we show how to transform the client so that it is itself realistically implemented; we demonstrate our method in the context of Ricart-Agrawala's mutual exclusion program.