NDLI: Be my guest:MCS lock now welcomes guests

Content Provider	ACM Digital Library
Author	Wang, Tianzheng Kimura, Hideaki Chabbi, Milind
Abstract	The MCS lock is one of the most prevalent queuing locks. It provides fair scheduling and high performance on massively parallel systems. However, the MCS lock mandates a bring-your-own-context policy: each lock user must provide an additional context (i.e., a queue node) to interact with the lock. This paper proposes MCSg, a variant of the MCS lock that relaxes this restriction. Our key observation is that not all lock users are created equal. We analyzed how locks are used in massively-parallel modern systems, such as NUMA-aware operating systems and databases. We found that such systems often have a small number of "regular" code paths that enter the lock very frequently. Such code paths are the primary beneficiary of the high scalability of MCS locks. However, there are also many "guest" code paths that infrequently enter the lock and do not need the same degree of fairness to access the lock (e.g., background tasks that only run periodically with lower priority). These guest users, which are typically spread out in various modules of the software, prefer context-free locks, such as ticket locks. MCSg provides these guests a context-free interface while regular users still enjoy the benefits provided by MCS. It can also be used as a drop-in replacement of MCS for more advanced locks, such as cohort locking. We also propose MCSg++, an extended version of MCSg, which avoids guest starvation and non-FIFO behaviors that might happen with MCSg. Our evaluation using microbenchmarks and the TPC-C database benchmark on a 16-socket, 240-core server shows that both MCSg and MCSg++ preserve the benefits of MCS for regular users while providing a context-free interface for guests.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/3016078.2851160
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	51
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	Spin locks Locking api Scalability Queued locks Throughput Mcs Fairness Latency
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

Be my guest: MCS lock now welcomes guests

High performance locks for multi-level NUMA systems

Lock cohorting:a general technique for designing NUMA locks

High performance locks for multi-level NUMA systems

Tidex:a mutual exclusion lock

Contention-conscious, locality-preserving locks

Scalable queue-based spin locks with timeout

Inferring locks for atomic sections

Lock reservation:Java locks can mostly do without atomic operations

Be my guest:MCS lock now welcomes guests

Similar Documents

Be my guest: MCS lock now welcomes guests

High performance locks for multi-level NUMA systems

Lock cohorting:a general technique for designing NUMA locks

High performance locks for multi-level NUMA systems

Tidex:a mutual exclusion lock

Contention-conscious, locality-preserving locks

Scalable queue-based spin locks with timeout

Inferring locks for atomic sections

Lock reservation:Java locks can mostly do without atomic operations

Be my guest:MCS lock now welcomes guests