A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Speeding Lamport's fast mutual exclusion algorithm
Information Processing Letters
Bounds on shared memory for mutual exclusion
Information and Computation
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
Time/contention trade-offs for multiprocessor synchronization
Information and Computation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Universal operations: unary versus binary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Disentangling multi-object operations (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Adaptive Mutual Exclusion with Local Spinning
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Algorithms adapting to point contention
Journal of the ACM (JACM)
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Long lived adaptive splitter and applications
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Adaptive algorithms using bounded memory are inherently non-uniform
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
We introduce a novel term, memory-adaptive, that intuitively captures what it means for a distributed protocol to most efficiently make use of its shared memory. We also prove three results that relate to our memory-adaptive model. In our store/release protocols processors are required to store a value in shared MWMR memory so that it cannot be overwritten until it has been released by the processor. We show that there do not exist uniformly wait-free store/release protocols using only the basic operations read and write that are memory-adaptive to point contention. We further show that there exists a uniformly wait-free store/release protocol using only the basic operations read and write that is memory-adaptive to total contention. We finally show that there exists a uniformly wait-free store/release protocol using only the basic operations read, write, and write-plus that is memory-adaptive to interval contention and time-adaptive to total contention.