Advertisement

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

  • Faith Ellen Fich
  • Victor Luchangco
  • Mark Moir
  • Nir Shavit
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3724)

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.

In our opinion, the main shortcoming of existing complexity measures for nonblocking algorithms is that they are targeted towardsworst-case behavior inworstcase scenarios, and say little about behavior inmore common cases.This is true for the sensitivity measure of Attiya and Dagan [1], and the d-local step complexity of Afek et al. [2]. These measures are directed at evaluating the behavior of algorithms under contention, i.e., when concurrent operations actively interfere with each other’s progress. However, in practice, a well-designed system manages contention so that it does not impact performance too greatly. Thus, these previous measures do not evaluate the behaviour that is likely to be observed.

Keywords

Complexity Measure Reachable State Step Complexity Concurrent Operation Contention Management 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Attiya, H., Dagan, E.: Improved implementations of binary universal operations. J. ACM 48, 1013–1037 (2001)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object oeprations. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 111–120 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Faith Ellen Fich
    • 2
  • Victor Luchangco
    • 1
  • Mark Moir
    • 1
  • Nir Shavit
    • 1
  1. 1.Sun Microsystems Laboratories 
  2. 2.University of Toronto 

Personalised recommendations