Time/contention trade-offs for multiprocessor synchronization

DOI10.1006/INCO.1996.0006zbMATH Open0844.68042OpenAlexW2001342371MaRDI QIDQ1908356FDOQ1908356

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

zbMATH Keywords

concurrent programaccess-contentionwrite-contention

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Database theory (68P15)

Cited In (16)

• Computing with infinitely many processes
• A complexity-based classification for multiprocessor synchronization
• Nonatomic mutual exclusion with local spinning
• Integrating synchronization with priority into a Kronecker representation
• A time complexity lower bound for adaptive mutual exclusion
• Hundreds of impossibility results for distributed computing
• On the cost of uniform protocols whose memory consumption is adaptive to interval contention
• Towards a real-time distributed computing model
• Shared-memory mutual exclusion: major research trends since 1986
• Title not available (Why is that?)
• Solo-valency and the cost of coordination
• Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
• Expected deadlock time in a multiprocessing system
• Reconciling fault-tolerant distributed algorithms and real-time computing
• Using local-spin k -exclusion algorithms to improve wait-free object implementations
• An improved lower bound for the time complexity of mutual exclusion

This page was built for publication: Time/contention trade-offs for multiprocessor synchronization

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