Contention-free complexity of shared memory algorithms

DOI10.1006/inco.1996.0034zbMath0853.68109OpenAlexW2065217717MaRDI QIDQ1917094

Gadi Taubenfeld, Rajeev Alur

Publication date: 12 December 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0034

zbMATH Keywords

shared memory algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (4)

Light-weight leases for storage-centric coordination ⋮ Computing with infinitely many processes ⋮ Nonatomic mutual exclusion with local spinning ⋮ Hundreds of impossibility results for distributed computing

This page was built for publication: Contention-free complexity of shared memory algorithms