Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity of network synchronization
Journal of the ACM (JACM)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
Information Processing Letters
A compositional approach to superimposition
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The inherent cost of achieving causal consistency
The inherent cost of achieving causal consistency
The Information Bus: an architecture for extensible distributed systems
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Replication and fault-tolerance in the ISIS system
Proceedings of the tenth ACM symposium on Operating systems principles
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Role of Inhibition on Asynchronous Consistent-Cut Protocols
Proceedings of the 3rd International Workshop on Distributed Algorithms
Process backup in producer-consumer systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
On Inhibition and Atomicity in Asynchronous Consistent-cut Protocols
On Inhibition and Atomicity in Asynchronous Consistent-cut Protocols
The Inhibition Spectrum and the Achievement of Causal Consistency
The Inhibition Spectrum and the Achievement of Causal Consistency
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Concurrent common knowledge: defining agreement for asynchronous systems
Distributed Computing
Guaranteed Mutually Consistent Checkpointing in Distributed Computations
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Concurrent Knowledge and Logical Clock Abstractions
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
The power of logical clock abstractions
Distributed Computing
Finding a suitable checkpoint and recovery protocol for a distributed application
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Detecting Arbitrary Stable Properties Using Efficient Snapshots
IEEE Transactions on Software Engineering
Nonintrusive snapshots using thin slices
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Hi-index | 0.00 |
We consider the problem of distinguishing causally-consistent global states in asynchronous distributed systems. Such states are fundamental to asynchronous systems, because they correspond to possible simultaneous global states; their detection arises in a variety of distributed applications, including global checkpointing, deadlock detection, termination detection, and broadcasting. A consistent-cut protocol is a protocol which in every run will designate for each processor a state, in such a way that these states together form a consistent cut. We analyze the cost of achieving causal consistency in terms of the extent to which a consistent-cut protocol delays events of the underlying system. We refer to the delaying action of a protocol as inhibition. A protocol using local inhibition may cause the delay of some of a processor's events until that processor has performed some number of local actions; a protocol using global inhibition may force the delay of some of a processor's events until that processor has received some communication from other processors. Based on a variety of system and protocol characteristics, including the ability to locally or globally inhibit particular types of events, we give three impossibility results and examine some existing protocols. We are then able to present a thirty-six case summary of protocols and impossibility results for the determination of causally-consistent states as a function of those characteristics. In particular, we demonstrate that local inhibition is necessary and sufficient to solve this problem for general FIFO systems, while global send inhibition is necessary and sufficient for general non-FIFO systems.