A Few Definitions and Two Introductory Examples
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.
KeywordsAlgorithm 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
Unable to display preview. Download preview PDF.