Non-blocking atomic commitment in distributed systems: A tutorial based on a generic protocol

被引:0
|
作者
Raynal, M [1 ]
机构
[1] Inst Rech Informat & Syst Aleatoires, F-35042 Rennes, France
来源
关键词
atomic commitment; consensus problem; distributed systems; failure detection; fault-tolerant protocols; non-blocking protocols; reliable multicast; transaction;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Agreement problems allow a set of processes to agree on a common output value. These problems are of primary importance in distributed systems and difficult to solve in presence of failures. This paper is a tutorial on one of these problems whose practical interest is well known, namely the Non-Blocking Atomic Commitment Problem This tutorial is based on an original generic protocol that solves the problem at an abstract level. Instantiations of its generic statements are given for both synchronous and asynchronous distributed systems. It is shown that the main problem to ensure the "non-blocking" property lies in failures detection. While failures can be safely detected in synchronous distributed systems, they can only be "suspected" (maybe falsely) in asynchronous distributed systems. So, this tutorial also visits problems such as reliable communication, failures detection and consensus whose solutions are used when instantiating the generic protocol in a particular context. Seen that way, this paper can be seen as a state-of-the-art introduction to concepts, problems and protocols related to fault-tolerance in distributed systems.
引用
收藏
页码:77 / 86
页数:10
相关论文
共 50 条
  • [21] Reliable global atomic commitment protocol for distributed multidatabase systems
    Korea Advanced Inst of Science and, Technology, Taejon, Korea, Republic of
    Inf Sci, 1-2 (75-102):
  • [22] On the weakest failure detector for Non-Blocking Atomic Commit
    Guerraoui, R
    Kouznetsov, P
    FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 461 - 473
  • [23] On the weakest failure detector for non-blocking atomic commit
    Guerraoui, Rachid
    Kouznetsov, Petr
    IFIP Advances in Information and Communication Technology, 2002, 96 : 461 - 473
  • [24] A Non-Blocking Online Cake-Cutting Protocol
    Kubo, Koki
    Manabe, Yoshifumi
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MATHEMATICS AND COMPUTERS IN SCIENCES AND IN INDUSTRY (MCSI 2016), 2016, : 258 - 263
  • [25] A fully non-blocking reliable multicast protocol with total ordering
    Iyer, M
    Siu, KY
    1977 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE, 1997, : 378 - 384
  • [26] A High Performance Asynchronous Non-blocking Data Communication Protocol
    Huang, Guimin
    Zheng, Zhi
    Zhou, Ya
    PROCEEDINGS OF 2016 IEEE 7TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2016), 2016, : 269 - 272
  • [27] A Scalable Non-blocking Multicast Scheme for Distributed DAG Scheduling
    Song, Fengguang
    Dongarra, Jack
    Moore, Shirley
    COMPUTATIONAL SCIENCE - ICCS 2009, PART I, 2009, 5544 : 195 - 204
  • [28] Non-blocking PMD monitoring in live optical systems
    Hui, R.
    Saunders, R.
    Heffner, B.
    Richards, D.
    Fu, B.
    Adany, P.
    ELECTRONICS LETTERS, 2007, 43 (01) : 53 - 54
  • [29] NON-BLOCKING DECENTRALIZED CONTROL OF DISCRETE EVENT SYSTEMS BASED ON PETRI NETS
    Lu, Feihua
    Wu, Weimin
    Su, Hongye
    Chu, Jian
    ASIAN JOURNAL OF CONTROL, 2010, 12 (03) : 323 - 335
  • [30] Fast non-blocking atomic commit: an inherent trade-off
    Dutta, P
    Guerraoui, R
    Pochon, B
    INFORMATION PROCESSING LETTERS, 2004, 91 (04) : 195 - 200