Contention-free complexity of shared memory algorithms

DOI10.1006/INCO.1996.0034MaRDI QIDQ1917094zbMATH OpenOpenAlexFDO

Authors Rajeev Alur, Gadi Taubenfeld

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)

Recommendations

• Contention in shared memory algorithms
• Time bounds for mutual exclusion and related problems
• Time/contention trade-offs for multiprocessor synchronization

Cited in

(8)

• Nonatomic mutual exclusion with local spinning
• Lower bounds on the amortized time complexity of shared objects
• Computing with infinitely many processes
• Contention in shared memory algorithms
• Shared memory and the Bakery algorithm
• Hundreds of impossibility results for distributed computing
• Light-weight leases for storage-centric coordination
• Conflict-free star-access in parallel memory systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917094)