Pages that link to "Item:Q1908356"
From MaRDI portal
The following pages link to Time/contention trade-offs for multiprocessor synchronization (Q1908356):
Displaying 22 items.
- Computing with infinitely many processes (Q391645) (← links)
- A time complexity lower bound for adaptive mutual exclusion (Q424906) (← links)
- A misconception in blocking time analyses under multiprocessor synchronization protocols (Q518846) (← links)
- On the cost of uniform protocols whose memory consumption is adaptive to interval contention (Q1004317) (← links)
- Towards a real-time distributed computing model (Q1004326) (← links)
- Synchronization costs on multiprocessors (Q1121003) (← links)
- Contention-free complexity of shared memory algorithms (Q1917094) (← links)
- Nonatomic mutual exclusion with local spinning (Q1954193) (← links)
- A complexity-based classification for multiprocessor synchronization (Q1988522) (← links)
- Reconciling fault-tolerant distributed algorithms and real-time computing (Q2251157) (← links)
- Solo-valency and the cost of coordination (Q2377250) (← links)
- Time bounds for mutual exclusion and related problems (Q2817613) (← links)
- Time-adaptive algorithms for synchronization (Q2817676) (← links)
- (Q3842794) (← links)
- Optimal Time–Space Tradeoff for Shared Memory Leader Election (Q4366876) (← links)
- Bounds on the speedup and efficiency of partial synchronization in parallel processing systems (Q4369862) (← links)
- Expected deadlock time in a multiprocessing system (Q4369875) (← links)
- Integrating synchronization with priority into a Kronecker representation (Q4538476) (← links)
- Using local-spin k -exclusion algorithms to improve wait-free object implementations (Q5137344) (← links)
- An improved lower bound for the time complexity of mutual exclusion (Q5138382) (← links)
- Shared-memory mutual exclusion: major research trends since 1986 (Q5138486) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
