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.
The multiplicative version of Azuma's inequality, with an application to contention analysis
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
BIDS algorithm for batched single-index global MAB with covariates achieves minimax-optimal regret rates when a pilot direction is accurate and K is fixed, avoiding the curse of dimensionality.
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.
-
Batched Single-Index Global Multi-Armed Bandits with Covariates
BIDS algorithm for batched single-index global MAB with covariates achieves minimax-optimal regret rates when a pilot direction is accurate and K is fixed, avoiding the curse of dimensionality.