Group communication in partitionable systems:: Specification and algorithms

被引:29
作者
Babaoglu, Ö [1 ]
Davoli, R [1 ]
Montresor, A [1 ]
机构
[1] Univ Bologna, Dept Comp Sci, I-40127 Bologna, Italy
关键词
group communication; view synchrony; partition-awareness; asynchronous systems; fault tolerance;
D O I
10.1109/32.917522
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
give a formal specification and an implementation for a partitionable group communication service in asynchronous distributed systems. Our specification is motivated by the requirements for building "partition-aware" applications that can continue operating without blocking in multiple concurrent partitions and reconfigure themselves dynamically when partitions merge. The specified service guarantees liveness and excludes trivial solutions, it constitutes a useful basis for building realistic partition-aware applications, and it is implementable in practical asynchronous distributed systems where certain stability conditions hold.
引用
收藏
页码:308 / 336
页数:29
相关论文
共 34 条
[1]   THE TOTEM SINGLE-RING ORDERING AND MEMBERSHIP PROTOCOL [J].
AMIR, Y ;
MOSER, LE ;
MELLIARSMITH, PM ;
AGARWAL, DA ;
CIARFELLA, P .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1995, 13 (04) :311-342
[2]  
AMIR Y, 1998, SPREAD WIDE AREAD GR
[3]  
ANCEAUME E, 1995, TR951534 CORN U COMP
[4]  
ANKER T, 1998, P DIMACS WORKSH NETW, P23
[5]  
Babaoglu O, 1998, INT CON DISTR COMP S, P184, DOI [10.1109/ICDCS.1998.679501, 10.1145/280559.280567]
[6]  
Babaoglu O., 1995, Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, P612, DOI 10.1109/HICSS.1995.375495
[7]   THE PROCESS GROUP-APPROACH TO RELIABLE DISTRIBUTED COMPUTING [J].
BIRMAN, KP .
COMMUNICATIONS OF THE ACM, 1993, 36 (12) :37-&
[8]  
BIRMAN KP, 1994, RELIABLE DISTRIBUTED
[9]  
Chandra T. D., 1996, Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, P322, DOI 10.1145/248052.248120
[10]   Unreliable failure detectors for reliable distributed systems [J].
Chandra, TD ;
Toueg, S .
JOURNAL OF THE ACM, 1996, 43 (02) :225-267