Algorithms for contention-resilient read/write and CAS registers with O(log P) latency w.h.p. under stochastic scheduler, using O(1) hardware registers, plus a space-latency lower bound.
Randomized mutual exclusion with sub-logarithmic RMR -complexity
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Lecture notes compiling standard topics and results in distributed systems theory from basic communication to population protocols and topological methods.
citing papers explorer
-
Fast Concurrent Primitives Despite Contention
Algorithms for contention-resilient read/write and CAS registers with O(log P) latency w.h.p. under stochastic scheduler, using O(1) hardware registers, plus a space-latency lower bound.
-
Notes on Theory of Distributed Systems
Lecture notes compiling standard topics and results in distributed systems theory from basic communication to population protocols and topological methods.