Towards an Elastic Lock-Free Hash Trie Design

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

Authors

Miguel Areias (Author) FCUP; Ricardo Rocha (Author) FCUP

Conference proceedings International

Title: 2021 20TH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING (ISPDC)

Pages: 9-16

20th International Symposium on Parallel and Distributed Computing (ISPDC)

ELECTR NETWORK, JUL 28-30, 2021

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Other information

Authenticus ID: P-00V-ANJ

DOI: 10.1109/ispdc52870.2021.9521630

Abstract (EN): A key aspect of any hash map design is the problem of dynamically resizing it in order to deal with hash collisions. In this context, elasticity refers to the ability to automatically resize the internal data structures that support the hash map operations in order to meet varying workloads, thus optimizing the overall memory consumption of the hash map. This work extends a previous lock-free hash trie design to support elastic hashing, i.e., expand saturated hash levels and compress unused hash levels, such that, at each point in time, the number of levels in a path matches the current demand as closely as possible. Experimental results show that elasticity effectively improves the search operation and, in doing so, our design becomes very competitive when compared to other state-of-the-art designs implemented in Java.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 8