Fault-tolerant total order multicast to asynchronous groups

被引:14
|
作者
Fritzke, U [1 ]
Ingels, P [1 ]
Mostefaoui, A [1 ]
Raynal, M [1 ]
机构
[1] IRISA, F-35042 Rennes, France
关键词
D O I
10.1109/RELDIS.1998.740503
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
While Total Order Broadcast (or Atomic Broadcast) primitives have received a lot of attention, this paper concentrates an Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems in which processes may suffer crash failures. "Multicast to Multiple Groups" means that each message is sent to a subset of the process groups composing the system, distinct messages possibly having distinct destination groups. "Total Order" means that all message deliveries must be totally ordered. This paper proposes a protocol for such a multicast primitive. This protocol is based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus. its design characteristics lie in the two following properties. The first one is a Minimality property, more precisely, only the sender of a message and processes of its destination groups have to participate in the multicast of the message. The second property is a Locality property: no execution of a consensus has to involve processes belonging to distinct groups (i.e., consensus are executed on a "per group" basis). This Locality property is particularly useful when one is interested in using the Total Order Multicast primitive in large scale distributed systems. An improvement that reduces the cost of the protocol is also suggested.
引用
收藏
页码:228 / 234
页数:7
相关论文
共 50 条
  • [31] Tree-based fault-tolerant multicast in multicomputer networks
    Wang, H
    Blough, DM
    SIXTH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, PROCEEDINGS, 1998, : 44 - 49
  • [32] Deadlock-free fault-tolerant multicast routing in hypercubes
    Sengupta, A.
    Viswanathan, S.
    Parallel Processing Letters, 2000, 10 (04) : 327 - 342
  • [33] An architecture for scalable, efficient, and fast fault-tolerant multicast provisioning
    Cui, JH
    Faloutsos, M
    Gerla, M
    IEEE NETWORK, 2004, 18 (02): : 26 - 34
  • [34] The Fault-tolerant Multicast based on the Family Relation and Network Coding
    Zhou Yan-ling
    PROCEEDINGS OF 2017 2ND INTERNATIONAL CONFERENCE ON COMMUNICATION AND INFORMATION SYSTEMS (ICCIS 2017), 2015, : 159 - 163
  • [35] A Fault-Tolerant Framework for Asynchronous Iterative Computations in Cloud Environments
    Wang, Zhigang
    Gao, Lixin
    Gu, Yu
    Bao, Yubin
    Yu, Ge
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2018, 29 (08) : 1678 - 1692
  • [36] A Fault-Tolerant Framework for Asynchronous Iterative Computations in Cloud Environments
    Wang, Zhigang
    Gao, Lixin
    Gu, Yu
    Bao, Yubin
    Yu, Ge
    PROCEEDINGS OF THE SEVENTH ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC 2016), 2016, : 71 - 83
  • [37] Fault-Tolerant Flocking in a k-Bounded Asynchronous System
    Souissi, Samia
    Yang, Yan
    Defago, Xavier
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 12TH INTERNATIONAL CONFERENCE, OPODIS 2008, 2008, 5401 : 145 - +
  • [38] On the Threat of Metastability in an Asynchronous Fault-Tolerant Clock Generation Scheme
    Fuchs, Gottfried
    Fuegger, Matthias
    Steininger, Andreas
    ASYNC: 2009 15TH IEEE INTERNATIONAL SYMPOSIUM ON ASYNCHRONOUS CIRCUITS AND SYSTEMS, 2009, : 118 - 127
  • [39] Fault diagnosis and fault-tolerant control of input/output asynchronous sequential machines
    Yang, J. -M.
    Kwak, S. W.
    IET CONTROL THEORY AND APPLICATIONS, 2012, 6 (11): : 1682 - 1689
  • [40] Fault-tolerant replication in networks with asynchronous communication link failures
    Lazoff, DM
    Stephens, AB
    1977 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE, 1997, : 131 - 136