Low cost management of replicated data in fault-tolerant distributed systems
ACM Transactions on Computer Systems (TOCS)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
An efficient implementation of vector clocks
Information Processing Letters
An optimal algorithm for distributed snapshots with causal message ordering
Information Processing Letters
Temporal interactions of intervals in distributed systems
Journal of Computer and System Sciences
An optimal algorithm for generalized causal message ordering
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
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
A Framework for Viewing Atomic Events in Distributed Computations
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
A Non-Blocking Lightweight Implementation of Causal Order Message Delivery
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Real-time causal message ordering in multimedia systems
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Causal separators for large-scale multicast communication
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Synchronous, asynchronous, and causally ordered communication
Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
A causality based time management mechanism for federated simulation
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Reducing False Causality in Causal Message Ordering
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Evaluation of the Optimal Causal Message Ordering Algorithm
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Performance of the Optimal Causal Multicast Algorithm: A Statistical Analysis
IEEE Transactions on Parallel and Distributed Systems
An alternative time management mechanism for distributed simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Proceedings of the 2008 Spring simulation multiconference
Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms
Proceedings of the 2010 ACM Symposium on Applied Computing
Lightweight causal cluster consistency
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
srCE: a collaborative editing of scalable semantic stores on P2P networks
International Journal of Computer Applications in Technology
| Hi-index | 0.00 |
This paper formulates necessary and sufficient conditions on the information required for enforcing causal ordering in a distributed system with asynchronous communication. The paper then presents an algorithm for enforcing causal message ordering. The algorithm allows a process to multicast to arbitrary and dynamically changing process groups. We show that the algorithm is optimal in the space complexity of the overhead of control information in both messages and message logs. The algorithm achieves optimality by transmitting the bare minimum causal dependency information specified by the necessity conditions, and using an encoding scheme to represent and transmit this information. We show that, in general, the space complexity of causal message ordering in an asynchronous system is Ω(n2), where n is the number of nodes in the system. Although the upper bound on space complexity of the overhead of control information in the algorithm is O(n2), the overhead is likely to be much smaller on the average, and is always the least possible.