NDLI: Lock-free and scalable multi-version software transactional memory

Content Provider	ACM Digital Library
Author	Cachopo, João Fernandes, Sérgio Miguel
Abstract	Software Transactional Memory (STM) was initially proposed as a lock-free mechanism for concurrency control. Early implementations had efficiency limitations, and soon obstruction-free proposals appeared, to tackle this problem, often simplifying STM implementation. Today, most of the modern and top-performing STMs use blocking designs, relying on locks to ensure an atomic commit operation. This approach has revealed better in practice, in part due to its simplicity. Yet, it may have scalability problems when we move into many-core computers, requiring fine-tuning and careful programming to avoid contention. In this paper we present and discuss the modifications we made to a lock-based multi-version STM in Java, to turn it into a lock-free implementation that we have tested to scale at least up to 192 cores, and which provides results that compete with, and sometimes exceed, some of today's top-performing lock-based implementations. The new lock-free commit algorithm allows write transactions to proceed in parallel, by allowing them to run their validation phase independently of each other, and by resorting to helping from threads that would otherwise be waiting to commit, during the write-back phase. We also present a new garbage collection algorithm to dispose of old unused object versions that allows for asynchronous identification of unnecessary versions, which minimizes its interference with the rest of the transactional system.
Starting Page	179
Ending Page	188
Page Count	10
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/2038037.1941579
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	46
Issue Number	8
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Garbage collection Multi-version concurrency control Lock-free synchronization Transactional memory
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design 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

Lock-free and scalable multi-version software transactional memory

The transactional memory / garbage collection analogy

Refined transactional lock elision

J.P.: Lock-free and scalable multi-version software transactional memory (2011)

Exploring garbage collection with haswell hardware transactional memory

On designing NUMA-aware concurrency control for scalable transactional memory

Is transactional programming actually easier?

A study of concurrent real-time garbage collectors

Scalable lock-free dynamic memory allocation

Lock-free and scalable multi-version software transactional memory

Similar Documents

Lock-free and scalable multi-version software transactional memory

The transactional memory / garbage collection analogy

Refined transactional lock elision

J.P.: Lock-free and scalable multi-version software transactional memory (2011)

Exploring garbage collection with haswell hardware transactional memory

On designing NUMA-aware concurrency control for scalable transactional memory

Is transactional programming actually easier?

A study of concurrent real-time garbage collectors

Scalable lock-free dynamic memory allocation

Lock-free and scalable multi-version software transactional memory