NDLI: Fast non-intrusive memory reclamation for highly-concurrent data structures

Please wait, while we are loading the content...

Block-free concurrent GC: stack scanning and copying

Understanding and improving JVM GC work stealing at the data center scale

Rust as a language for high performance GC implementation

Characterizing emerging heterogeneous memory

Persistence programming models for non-volatile memory

Prescient memory: exposing weak memory model behavior by looking into the future

Hardware support for protective and collaborative cache sharing

CBufs: efficient, system-wide memory management and sharing

Rethinking a heap hierarchy as a cache hierarchy: a higher-order theory of memory demand (HOTM)

Fast non-intrusive memory reclamation for highly-concurrent data structures

A bounded memory allocator for software-defined global address spaces

Liveness-based garbage collection for lazy languages

Fast non-intrusive memory reclamation for highly-concurrent data structures

Content Provider	ACM Digital Library
Author	Dice, Dave Kogan, Alex Herlihy, Maurice
Abstract	Current memory reclamation mechanisms for highly-concurrent data structures present an awkward trade-off. Techniques such as epoch-based reclamation perform well when all threads are running on dedicated processors, but the delay or failure of a single thread will prevent any other thread from reclaiming memory. Alternatives such as hazard pointers are highly robust, but they are expensive because they require a large number of memory barriers. This paper proposes three novel ways to alleviate the costs of the memory barriers associated with hazard pointers and related techniques. These new proposals are backward-compatible with existing code that uses hazard pointers. They move the cost of memory management from the principal code path to the infrequent memory reclamation procedure, significantly reducing or eliminating memory barriers executed on the principal code path. These proposals include (1) exploiting the operating system's memory protection ability, (2) exploiting certain x86 hardware features to trigger memory barriers only when needed, and (3) a novel hardware-assisted mechanism, called a hazard lookaside buffer (HLB) that allows a reclaiming thread to query whether there are hazardous pointers that need to be flushed to memory. We evaluate our proposals using a few fundamental data structures (linked lists and skiplists) and libcuckoo, a recent high-throughput hash-table library, and show significant improvements over the hazard pointer technique. .
Starting Page	36
Ending Page	45
Page Count	10
File Format	PDF
ISBN	9781450343176
DOI	10.1145/2926697.2926699
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-06-14
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Memory barriers Memory reclamation Hazard pointers Concurrent data structures
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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