NDLI: The complexity of obstruction-free implementations

Content Provider	ACM Digital Library
Author	Attiya, Hagit Guerraoui, Rachid Hendler, Danny Kuznetsov, Petr
Copyright Year	2009
Abstract	$\textit{Obstruction-free}$ implementations of concurrent objects are optimized for the common case where there is no step contention, and were recently advocated as a solution to the costs associated with synchronization without locks. In this article, we study this claim and this goes through precisely defining the notions of obstruction-freedom and step contention. We consider several classes of obstruction-free implementations, present corresponding generic object implementations, and prove lower bounds on their complexity. Viewed collectively, our results establish that the worst-case operation time complexity of obstruction-free implementations is high, even in the absence of step contention. We also show that lock-based implementations are not subject to some of the time-complexity lower bounds we present.
Starting Page	1
Ending Page	33
Page Count	33
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/1538902.1538908
Journal	Journal of the ACM (JACM)
Volume Number	56
Issue Number	4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-07-02
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Shared memory Lower bounds Memory contention Perturbable objects Solo-fast implementations Step contention
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The Space Complexity of Long-Lived and One-Shot Timestamp Implementations

Synchronizing without locks is inherently expensive

Time lower bounds for implementations of multi-writer snapshots

Algorithms adapting to point contention

Fault-tolerant wait-free shared objects

Contention in shared memory algorithms

Tight Bounds for Asynchronous Renaming

Nonuniform ACC Circuit Lower Bounds

Improved implementations of binary universal operations

The complexity of obstruction-free implementations

Similar Documents

The Space Complexity of Long-Lived and One-Shot Timestamp Implementations

Synchronizing without locks is inherently expensive

Time lower bounds for implementations of multi-writer snapshots

Algorithms adapting to point contention

Fault-tolerant wait-free shared objects

Contention in shared memory algorithms

Tight Bounds for Asynchronous Renaming

Nonuniform ACC Circuit Lower Bounds

Improved implementations of binary universal operations

The complexity of obstruction-free implementations