Have Your Cake and Eat it (Too): A Concurrent Hash Table with Hardware Transactions.
Saved in:
| Title: | Have Your Cake and Eat it (Too): A Concurrent Hash Table with Hardware Transactions. |
|---|---|
| Authors: | Chen, Zhiwen1 zhiwenchen@hnu.edu.cn, He, Xin1 xinhe@hnu.edu.cn, Sun, Jianhua1 jhsun@hnu.edu.cn, Chen, Hao1 haochen@hnu.edu.cn |
| Source: | International Journal of Parallel Programming. Aug2018, Vol. 46 Issue 4, p699-709. 11p. |
| Subjects: | Computer storage devices, Synchronization software, Workload of computers, Data structures, Electronic data processing |
| Abstract: | Hardware Transaction Memory (HTM) opens a new way to scaling multi-core software. Its main target is to achieve high performance on multi-core systems, and at the same time simplify concurrency control and guarantee correctness. This paper presents the redesign of an existing concurrent hash table using several HTM-based synchronization mechanisms. As compared with a fine-grained lock implementation, HTM-based locking scales well on our testing platform, and its performance is higher when running large-scale workloads. In addition, HTM-based global locking consumes much less memory. In summary, several observations are made in this paper with detailed experimental analysis, which would have important implications for future research of concurrent data structures and HTM. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Hardware Transaction Memory (HTM) opens a new way to scaling multi-core software. Its main target is to achieve high performance on multi-core systems, and at the same time simplify concurrency control and guarantee correctness. This paper presents the redesign of an existing concurrent hash table using several HTM-based synchronization mechanisms. As compared with a fine-grained lock implementation, HTM-based locking scales well on our testing platform, and its performance is higher when running large-scale workloads. In addition, HTM-based global locking consumes much less memory. In summary, several observations are made in this paper with detailed experimental analysis, which would have important implications for future research of concurrent data structures and HTM. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 08857458 |
| DOI: | 10.1007/s10766-017-0529-7 |
