On the Uncontended Complexity of Consensus

Victor Luchangco, Mark Moir, Nir Shavit

Abstract: Lock-free algorithms are not required to guarantee a bound on the number of steps an operation takes under contention, so we cannot use the usual worst-case analysis to quantify them. A natural alternative is to consider the worst-case time complexity of operations executed in the more common uncontended case.