Chapter 20 Network Resource Allocation
Having now finished Chapters 16–19, on general methods for programming asynchronous networks, we now resume our study of specific problems in asynchronous networks. In this chapter, we revisit the problem of mutual exclusion and the more general problem of resource allocation, which we studied in Chapters 10 and 11 in the asynchronous shared memory setting. Next, in Chapter 21, we consider consensus and other problems in asynchronous networks in which some of the processes might fail. The final chapter on asynchronous computing is Chapter 22, in which we study the problem of reliable communication over unreliable channels.
20.1 Mutual Exclusion
We begin with the mutual exclusion problem.
20.1.1 The Problem ...
Get Distributed Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
