Paper Info
Title
Reliable group communication in distributed systems
Abstract
The design and implementation of a reliable group communication mechanism is presented. The mechanism guarantees a form of atomicity in that the messages are received by all operational members of the group or by none of them. Since the overhead in enforcing the order of messages is nontrivial, the mechanism provides two types of message transmission: one guarantees delivery of the messages in the same order to all members of a group, and the other guarantees only atomicity with messages delivered in some arbitrary order. The message-ordering property can be used to simplify distributed database and distributed processing algorithms. The mechanism can survive despite process, host, and communication failures
Year
DOI
Venue
1988
10.1109/DCS.1988.12546
San Jose, CA
Keywords
Field
DocType
computer networks,distributed databases,fault tolerant computing,protocols,reliability,arbitrary order,atomicity,distributed database,distributed processing algorithms,distributed systems,message transmission,message-ordering,reliable group communication mechanism
Atomicity,Distributed object,Concurrency control,Computer science,Distributed data store,Communication in small groups,Computer network,Distributed algorithm,Distributed concurrency control,Distributed database,Distributed computing
Conference
Citations 
PageRank 
References 
40
12.14
7
Authors
3
Name
Order
Citations
PageRank
Navaratnam, S.14012.14
Samuel T. Chanson21019109.88
Gerald Neufeld339480.81