EHS: An Efficient Hashing Scheme for Persistent Memory
Abstract
References
Index Terms
- EHS: An Efficient Hashing Scheme for Persistent Memory
Recommendations
Extendible hashing—a fast access method for dynamic files
Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data associated with a given unique identifier, or key. Unlike conventional hashing, extendible hashing has a dynamic structure that ...
Parallel Multi-split Extendible Hashing for Persistent Memory
ICPP '21: Proceedings of the 50th International Conference on Parallel ProcessingEmerging persistent memory (PM) is a promising technology that provides near-DRAM performance and disk-like durability. However, many data structures designed based on DRAM, such as hash table and B-tree, are sub-optimal for PM. Prior studies have ...
WALSH: Write-Aggregating Log-Structured Hashing for Hybrid Memory
Persistent memory (PM) brings important opportunities for improving data storage including the widely used hash tables. However, PM is not friendly to small writes, which causes existing PM hashes to suffer from high hardware write amplification. Hybrid ...
Comments
Information & Contributors
Information
Published In
- Conference Chairs:
- Jiman Hong,
- Maart Lanperne,
- Program Chairs:
- Juw Won Park,
- Tomas Cerny,
- Publication Chair:
- Hossain Shahriar
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Funding Sources
- National Research Foundation of the Korea government (MSIT)
- Korea Institute for Advancement of Technology (KIAT) grant funded by the Korea Government (MOTIE)
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 83Total Downloads
- Downloads (Last 12 months)20
- Downloads (Last 6 weeks)3
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in