Memory Reclamation Methods for Lock-Free Hash Tries

• Type: Article in International Conference Proceedings Book
• Date: 2019

Authors

Moreno, P (Author) Other; Miguel Areias (Author) FCUP; Ricardo Rocha (Author) FCUP

Conference proceedings International

Title: 2019 31ST INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD 2019)

Pages: 188-195

31st International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

Campo Grande, BRAZIL, OCT 15-18, 2019

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 2 Citations

Other information

Authenticus ID: P-00R-GR4

DOI: 10.1109/sbac-pad.2019.00039

Abstract (EN): Hash tries are a trie-based data structure with nearly ideal characteristics for the implementation of hash maps. Starting from a particular lock-free hash map data structure, named Lock-Free Hash Tries (LFHT), we focus on solving the problem of memory reclamation without losing the lock-freedom property. We propose an approach that explores the characteristics of the LFHT structure in order to achieve efficient memory reclamation with low and well-defined memory bounds. Experimental results show that our approach obtains better results when compared with other state-of-the-art memory reclamation methods and provides a competitive and scalable hash map implementation, if compared to lock-based implementations.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 8