Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
An efficient reliable broadcast protocol
ACM SIGOPS Operating Systems Review
AMp: a highly parallel atomic multicast protocol
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Groupware: some issues and experiences
Communications of the ACM
Ordered and reliable multicast communication
ACM Transactions on Computer Systems (TOCS)
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Understanding the limitations of causally and totally ordered communication
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Precision synchronization of computer network clocks
ACM SIGCOMM Computer Communication Review
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Protocol for Atomic Broadcast
IEEE Transactions on Parallel and Distributed Systems
Causally Ordering Group Communication Protocol
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Multimedia intra-group communication protocol
HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
Distributed protocol for selective intra-group communication
ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
Hi-index | 0.00 |
In distributed applications, a group of multiple objects are cooperated. Kinds of group communication protocols have been discussed so far, which support the reliable and ordered delivery of messages at the network level. However, only messages to be ordered at the application level are required to be causally delivered. The state of the object depends on in what order the conflicting requests are computed and the responses and requests are transmitted. In this paper, we define the object-based precedence order of messages based on the conflicting relation among the requests. We discuss a protocol which supports the object-based ordered delivery of request and response messages.