23.1. Introduction
In this chapter we focus on the special problems associated with designing algorithms which are implemented with distributed components. Many are useful building blocks for designing distributed systems.
Chapter 7 introduced the fundamental properties of distributed computations: concurrent execution of components, independent failure modes of components, communications delay, potential inconsistency of data and absence of a single timeframe.
Here, we shall assume that the nodes involved have clocks that are synchronized as described in Chapter 7. Some of the algorithms we consider will make use of locally issued time-stamps, using process identifiers to arbitrate between requests with equal time-stamps. We shall be concerned ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access