Abstract
This chapter introduces basic definitions and basic computing models associated with fault-tolerant message-passing distributed systems. It also presents two simple distributed computing problems, whose aim is to give a first intuition of what can be done and what cannot be done in message-passing systems prone to failures. Consequently, this chapter must be considered as an introductory warm-up chapter.
Access provided by CONRICYT-eBooks. Download to read the full chapter text
Chapter PDF
Keywords
- Algorithm
- Automaton
- Asynchronous system
- Byzantine process
- Communication graph
- Distributed algorithm
- Distributed computing model
- Distributed computing problem
- Fair communication channel
- Liveness property
- Message adversary
- Message loss
- Non-determinism
- Process crash failure
- Process mobility
- Safety property
- Spanning tree
- Synchronous system
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Raynal, M. (2018). A Few Definitions and Two Introductory Examples. In: Fault-Tolerant Message-Passing Distributed Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-94141-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-94141-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94140-0
Online ISBN: 978-3-319-94141-7
eBook Packages: Computer ScienceComputer Science (R0)