Obstruction-Free Step Complexity: Lock-Free DCAS as an Example

Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit

Abstract: We propose obstruction-free step complexity, a new complexity measure for nonblocking algorithms. We believe that this measure provides a more pragmatic quanti.cation of nonblocking algorithms than previous measures, providing better guidance for designers of practical nonblocking algorithms.