Skip to Content
Distributed Algorithms
book

Distributed Algorithms

by Nancy A. Lynch
April 1996
Intermediate to advanced
904 pages
23h 54m
English
Morgan Kaufmann
Content preview from Distributed Algorithms

Chapter 24 Mutual Exclusion with Partial Synchrony

In this chapter, we visit the mutual exclusion problem for the third time, this time in the partially synchronous shared memory setting. We present only very basic results: simple timing-based algorithms and their analysis, and simple impossibility results.

24.1 The Problem

The setting is very much the same as in Chapter 10—a shared memory system with n ports, interacting with users U1,…, Un. The external interface, consisting of tryi, criti, exiti, and remii actions, is exactly the same as before. This time, however, the users and the shared memory system are modelled as MMT automata, as defined in Section 23.1, rather than as I/O automata. Figure 10.4 can still be used to represent the architecture ...

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

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

Data Algorithms

Data Algorithms

Mahmoud Parsian
Learning Algorithms

Learning Algorithms

George Heineman
Graph Algorithms

Graph Algorithms

Mark Needham, Amy E. Hodler

Publisher Resources

ISBN: 9781558603486