Towards a Lock-Free, Fixed Size and Persistent Hash Map Design

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

Authors

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

Conference proceedings International

Title: Proceedings - 29th International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2017

Pages: 145-152

29th International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2017

17 October 2017 through 20 October 2017

Indexing

Scopus - 5 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-00N-B3Y

DOI: 10.1109/SBAC-PAD.2017.26

Abstract (EN): Hash tries are a trie-based data structure with nearly ideal characteristics for the implementation of hash maps. In this paper, we present a novel, simple and scalable hash trie map design that fully supports the concurrent search, insert and remove operations on hash maps. To the best of our knowledge, our proposal is the first concurrent hash map design that puts together the following characteristics: (i) be lock-free; (ii) use fixed size data structures; and (iii) maintain the access to all internal data structures as persistent memory references. Experimental results show that our proposal is quite competitive when compared against other state-of-the-art proposals implemented in Java. Its design is modular enough to allow different types of configurations aimed for different performances in memory usage and execution time. © 2017 IEEE.

Language: English

Type (Professor's evaluation): Scientific