TY - GEN
T1 - Timing-based mutual exclusion
AU - Lynch, Nancy
AU - Shavit, Nir
PY - 1992
Y1 - 1992
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84880853991&partnerID=8YFLogxK
U2 - 10.1109/REAL.1992.242681
DO - 10.1109/REAL.1992.242681
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84880853991
SN - 0818631953
SN - 9780818631955
T3 - Proceedings - Real-Time Systems Symposium
SP - 2
EP - 11
BT - Proceedings - Real-Time Systems Symposium, RTSS 1992
T2 - 1992 Real-Time Systems Symposium, RTSS 1992
Y2 - 2 December 1992 through 4 December 1992
ER -