NDLI: Queue-Based and Adaptive Lock Algorithms for Scalable Resource Allocation on Shared-Memory Multiprocessors

Content Provider	Springer Nature Link
Author	Zhang, Deli Lynch, Brendan Dechev, Damian
Copyright Year	2014
Abstract	We present a scalable lock algorithm and an adaptive scheme for shared-memory multiprocessors addressing the resource allocation problem, which is also known as the $$h$$ -out-of- $$k$$ mutual exclusion problem. In this problem, threads compete for $$k$$ shared resources where a thread may request an arbitrary number $$1\le h\le k$$ of resources at the same time. The challenge is for each thread to acquire exclusive access to desired resources while preventing deadlock or starvation. Many existing approaches solve this problem in a distributed system, but the explicit message passing paradigm they adopt is not optimal for shared-memory. Other applicable methods, like two-phase locking and resource hierarchy, suffer from performance degradation under heavy contention, while lacking a desirable fairness guarantee. This work describes the first multi-resource lock algorithm that guarantees the strongest first-in, first-out fairness. Our methodology is based on a non-blocking queue where competing threads spin on previous conflicting resource requests. In our experimental evaluation we compared the overhead and scalability of our lock to the best available alternative approaches using a micro-benchmark. As contention increases, our multi-resource lock obtains an average of eight times speed-up over the alternatives including GNU C++’s lock method, Boost’s lock function, and Intel TBB’s queue mutex. To further improve the performance on low levels of contention, we introduce an adaptive scheme that is composed of two different lock algorithms and alternates the use the locks depending on the level of contention. Our experimental results show that the composite adaptive scheme achieves the best overall performance comparing with using either lock alone when system contention is not known a priori.
Starting Page	721
Ending Page	751
Page Count	31
File Format	PDF
ISSN	08857458
Journal	International Journal of Parallel Programming
Volume Number	43
Issue Number	5
e-ISSN	15737640
Language	English
Publisher	Springer US
Publisher Date	2014-08-15
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	$$H$$ -out-of- $$k$$ mutual exclusion Lock-free programming Queue-based lock Resource allocation Theory of Computation Processor Architectures Software Engineering/Programming and Operating Systems
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Information Systems 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

Fast and Scalable Queue-Based Resource Allocation Lock on Shared-Memory Multiprocessors.

An Integrated Hardware/Software Data Prefetching Scheme for Shared-Memory Multiprocessors$^{1}$

Asteroid: Scalable Online Memory Diagnostics for Multi-core, Multi-socket Servers

1 prioritized h-out of-k resource allocation for mobile ad hoc networks and distributed systems.

Scalable readerwriter synchronization for shared-memory multiprocessors (1991)

Scalable Spin Locks for Multiprogrammed Systems (1994)

Scalable Spin Locks for Multiprogrammed Systems (1994)

Scalable reader-writer synchronization for shared-memory multiprocessors (1991)

B-Queue: Efficient and Practical Queuing for Fast Core-to-Core Communication

Queue-Based and Adaptive Lock Algorithms for Scalable Resource Allocation on Shared-Memory Multiprocessors

Similar Documents

Fast and Scalable Queue-Based Resource Allocation Lock on Shared-Memory Multiprocessors.

An Integrated Hardware/Software Data Prefetching Scheme for Shared-Memory Multiprocessors$^{1}$

Asteroid: Scalable Online Memory Diagnostics for Multi-core, Multi-socket Servers

1 prioritized h-out of-k resource allocation for mobile ad hoc networks and distributed systems.

Scalable readerwriter synchronization for shared-memory multiprocessors (1991)

Scalable Spin Locks for Multiprogrammed Systems (1994)

Scalable Spin Locks for Multiprogrammed Systems (1994)

Scalable reader-writer synchronization for shared-memory multiprocessors (1991)

B-Queue: Efficient and Practical Queuing for Fast Core-to-Core Communication

Queue-Based and Adaptive Lock Algorithms for Scalable Resource Allocation on Shared-Memory Multiprocessors