Obstruction-free step complexity: Lock-free DCAS as an example

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3724 LNCS, Issue , 2005, Pages 493-494

  Fich, Faith Ellen ^b   Luchangco, Victor ^a   Moir, Mark ^a   Shavit, Nir ^a  

^a SUN MICROSYSTEMS   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646392445     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_37     Document Type: Conference Paper

References (2)

1. Attiya, H., Dagan, E.: Improved implementations of binary universal operations. J. ACM 48 (2001) 1013-1037
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. (1997) 111-120