On the implementation of memory reclamation methods in a lock-free hash trie design

• Tipo: Artigo em Revista Científica Internacional
• Data: 2021

Autores

Moreno, P (Autor) Outra; Miguel Areias (Autor) FCUP; Ricardo Rocha (Autor) FCUP

Revista

Título: Journal of Parallel and Distributed Computing

Vol. 155

Páginas: 1-13

ISSN: 0743-7315

Editora: Elsevier

Indexação

ISI Web of Knowledge - 1 Citação

Scopus - 1 Citação

Outras Informações

ID Authenticus: P-00T-VS9

DOI: 10.1016/j.jpdc.2021.04.007

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, we focus on solving the problem of memory reclamation without losing the lock-freedom property. To the best of our knowledge, outside garbage collected environments, there is no current implementation of hash maps that is able to reclaim memory in a lock-free manner. To achieve this goal, we propose an approach for memory reclamation specific to Lock-Free Hash Tries that explores the characteristics of its structure in order to achieve efficient memory reclamation with low and well-defined memory bounds. We present and discuss in detail the key algorithms required to easily reproduce our implementation by others. 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 13