On the cost of uniform protocols whose memory consumption is adaptive to interval contention
From MaRDI portal
Publication:1004317
DOI10.1016/j.tcs.2008.10.007zbMath1157.68014OpenAlexW2066335392MaRDI QIDQ1004317
Publication date: 2 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.007
adaptive algorithmsshared memoryinfinitely many processesstorage area networkasynchronous distributed systemmemory complexityuniform protocol
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetry breaking in distributed networks
- Speeding Lamport's fast mutual exclusion algorithm
- Bounds on shared memory for mutual exclusion
- Wait-free algorithms for fast, long-lived renaming
- Time/contention trade-offs for multiprocessor synchronization
- The concurrency hierarchy, and algorithms for unbounded concurrency
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
- Universal operations
- Algorithms adapting to point contention
- Wait-free consensus with infinite arrivals
- Adaptive solutions to the mutual exclusion problem
- Long lived adaptive splitter and applications
- An adaptive collect algorithm with applications
- Disk Paxos
- Hundreds of impossibility results for distributed computing
- Active disk paxos with infinitely many processes
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
- Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
- Adaptive and efficient mutual exclusion (extended abstract)
- Disentangling multi-object operations (extended abstract)
- Efficient Adaptive Collect Using Randomization
- Lower bounds for adaptive collect and related objects
- Byzantine disk paxos
- Distributed Computing
This page was built for publication: On the cost of uniform protocols whose memory consumption is adaptive to interval contention
