Time/contention trade-offs for multiprocessor synchronization
From MaRDI portal
Publication:1908356
DOI10.1006/inco.1996.0006zbMath0844.68042OpenAlexW2001342371MaRDI QIDQ1908356
James H. Anderson, Jae-Heon Yang
Publication date: 19 March 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7e06b2e4c30b90fc937c74a0a6bfed518ed1b3e7
Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (11)
Solo-valency and the cost of coordination ⋮ An improved lower bound for the time complexity of mutual exclusion ⋮ Computing with infinitely many processes ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Nonatomic mutual exclusion with local spinning ⋮ Using local-spin k -exclusion algorithms to improve wait-free object implementations ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Hundreds of impossibility results for distributed computing ⋮ Reconciling fault-tolerant distributed algorithms and real-time computing ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention ⋮ Towards a real-time distributed computing model
This page was built for publication: Time/contention trade-offs for multiprocessor synchronization
