The Notion of Universality in Crash-Prone Asynchronous Message-Passing Systems: a Tutorial

被引:1
作者
Raynal, Michel [1 ,2 ]
机构
[1] Univ Rennes, INRIA, CNRS, IRISA, F-35000 Rennes, France
[2] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
来源
2019 IEEE 38TH INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2019) | 2019年
关键词
Agreement; Asynchronous system; Atomic operations; Concurrent object; Consensus; Computability; Crash failure; Distributed Computing; Distributed state machine; Environment; Progress condition; Fault-tolerance; Message-passing; Read/write registers; Sequential specification; Universal construction; CONSENSUS; AGREEMENT; MEMORY;
D O I
10.1109/SRDS47363.2019.00046
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The notion of a universal construction is central in computing science and technology: general solutions make life easier and the wheel has not to be reinvented each time a new problem appears. In the context of message-passing asynchronous distributed systems made up of n processes, where some of them may commit crash failures, a universal construction is an algorithm that is able to build any object defined by a sequential specification despite the adversary effect resulting from the combination of asynchrony and process crashes. The aim of this tutorial is to introduce the reader to the notion of a distributed universal construction (and universal objects these constructions rely on), and more precisely, explain what can be done, what cannot be done, and which assumptions on the environment are necessary in order objects with provably reliability properties can be built. Its aim is be a guided tour providing the reader with the basic knowledge needed to understand and master asynchronous message-passing fault-tolerant computing. Its spirit is not to be a catalog of constructions proposed so far, but an as simple as possible presentation of concepts and mechanisms that constitute the basis these universal constructions rely on.
引用
收藏
页码:334 / 350
页数:17
相关论文
共 59 条
  • [1] ATOMIC SNAPSHOTS OF SHARED-MEMORY
    AFEK, Y
    ATTIYA, H
    DOLEV, D
    GAFNI, E
    MERRITT, M
    SHAVIT, N
    [J]. JOURNAL OF THE ACM, 1993, 40 (04) : 873 - 890
  • [2] Aguilera M.K., 2004, P 23 ACM S PRINC DIS, P328, DOI [DOI 10.1145/1011767.1011816, 10.1145/1011767.1011816]
  • [3] RENAMING IN AN ASYNCHRONOUS ENVIRONMENT
    ATTIYA, H
    BARNOY, A
    DOLEV, D
    PELEG, D
    REISCHUK, R
    [J]. JOURNAL OF THE ACM, 1990, 37 (03) : 524 - 548
  • [4] Efficient and robust sharing of memory in message-passing systems
    Attiya, H
    [J]. JOURNAL OF ALGORITHMS, 2000, 34 (01) : 109 - 127
  • [5] SHARING MEMORY ROBUSTLY IN MESSAGE-PASSING SYSTEMS
    ATTIYA, H
    BARNOY, A
    DOLEV, D
    [J]. JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (01): : 124 - 142
  • [6] Ben-Or M., 1983, ACM S PRINC DISTR CO, P27
  • [7] Borowsky E., 1993, Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, P91, DOI 10.1145/167088.167119
  • [8] ASYNCHRONOUS CONSENSUS AND BROADCAST PROTOCOLS
    BRACHA, G
    TOUEG, S
    [J]. JOURNAL OF THE ACM, 1985, 32 (04) : 824 - 840
  • [9] Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability
    Castaneda, Armando
    Rajsbaum, Sergio
    Raynal, Michel
    [J]. JOURNAL OF THE ACM, 2018, 65 (06)
  • [10] Castañeda A, 2011, COMPUT SCI REV, V5, P229, DOI 10.1016/j.cosrev.2011.04.001