Timing-based mutual exclusion

Nancy Lynch*, Nir Shavit

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

37 Scopus citations

Abstract

Known asynchronous n-process deadlock-free mutual exclusion algorithms require 0{n) read/write registers and 0(n) operations to access the critical region, rendering them impractical for large scale applications. Burns and Lynch have shown that n registers are necessary for solving this problem, in the asynchronous setting.

Original languageEnglish
Title of host publicationProceedings - Real-Time Systems Symposium, RTSS 1992
Pages2-11
Number of pages10
DOIs
StatePublished - 1992
Event1992 Real-Time Systems Symposium, RTSS 1992 - Phoenix, AZ, United States
Duration: 2 Dec 19924 Dec 1992

Publication series

NameProceedings - Real-Time Systems Symposium
ISSN (Print)1052-8725

Conference

Conference1992 Real-Time Systems Symposium, RTSS 1992
Country/TerritoryUnited States
CityPhoenix, AZ
Period2/12/924/12/92

Fingerprint

Dive into the research topics of 'Timing-based mutual exclusion'. Together they form a unique fingerprint.

Cite this