Bounds on Contention Management Algorithms

  title={Bounds on Contention Management Algorithms},
  author={Johannes Schneider and Roger Wattenhofer},
We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds. Our randomized algorithm is efficient: in some notorious problem instances (e.g., dining philosophers) it is exponentially faster than prior work from a worst case perspective. Both algorithms are (i) local and (ii) starvation-free. Our algorithms are local because they do not use global synchronization data structures (e.g., a… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 26 extracted citations


Publications referenced by this paper.

Similar Papers

Loading similar papers…