Hao Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hao Hu has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Wen Xia
Harbin Institute of Technology, Shenzhen, Shenzhen, Guangdong, China
3 shared publications - Xiangyu Zou
Harbin Institute of Technology, Shenzhen, Shenzhen, Guangdong, China
3 shared publications - Hongpeng Wang
Harbin Institute of Technology (Shenzhen)
2 shared publications - Erci Xu
Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Qi Chen
Harbin Institute of Technology Shenzhen
1 shared publication - Shihao Wang
Harbin Institute of Technology, Shenzhen, Guangdong, China
1 shared publication
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
ZipFloat: An Ultra-fast and Lossless Floating-Point Compressor for LLM Inference Systems
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessZipFloat: An Ultra-fast and Lossless Floating-Point Compressor for LLM Inference Systems
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 265-278
A High-Performance Persistent Transactional Memory System via Cooperative Concurrency Control
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 265-278
Open AccessA High-Performance Persistent Transactional Memory System via Cooperative Concurrency Control
- Open Access
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-28
Towards Efficient Extendible Perfect Hashing for Hybrid PM-DRAM Memory
Hashing is a widely used and efficient indexing mechanism for key-value storage. The emergence of persistent memory (PM) has further enhanced hash indexes by providing non-volatility and DRAM-like performance. However, current research on PM-based hash indexes primarily focuses on hardware-specific persistence optimizations or write performance optimization, while neglecting the critical aspect of read performance. Our study reveals that hash collisions significantly impair the read performance of hash indexes on PM. Thus, perfect hashing, which eliminates collisions, has the potential to improve read performance. Nevertheless, due to PM’s high access latency, the data movement overhead during hash table expansion and the random accesses introduced by perfect hashing itself present performance bottlenecks. In this article, we propose EEPH+, an efficient perfect hashing scheme for PM that effectively eliminates hash collisions to enhance read performance. EEPH+ employs three techniques to alleviate the aforementioned bottlenecks and improve performance: an extendible hashing technique to reduce the data movement overhead during hash table expansion, a hybrid PM–DRAM layout where the index structure resides in DRAM combined with a complement move algorithm to minimize the random accesses inherent to perfect hashing, and a batching and prefetching scheme to facilitate the parallel execution of hash computations and data accesses across multiple searches, thereby further boosting read performance. We compare EEPH+ with the state-of-the-art hash indexes on PM by conducting comprehensive experiments on several real-world read-intensive and read-skew workloads. The experimental results confirm the superiority of our EEPH+, which outperforms state-of-the-art hash indexes by up to 3.6× in read throughput and 3.14× in 99th percentile latency.
- 15 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (4) , 1-28
Open AccessTowards Efficient Extendible Perfect Hashing for Hybrid PM-DRAM Memory
Hashing is a widely used and efficient indexing mechanism for key-value storage. The emergence of persistent memory (PM) has further enhanced hash indexes by providing non-volatility and DRAM-like performance. However, current research on PM-based hash indexes primarily focuses on hardware-specific persistence optimizations or write performance optimization, while neglecting the critical aspect of read performance. Our study reveals that hash collisions significantly impair the read performance of hash indexes on PM. Thus, perfect hashing, which eliminates collisions, has the potential to improve read performance. Nevertheless, due to PM’s high access latency, the data movement overhead during hash table expansion and the random accesses introduced by perfect hashing itself present performance bottlenecks. In this article, we propose EEPH+, an efficient perfect hashing scheme for PM that effectively eliminates hash collisions to enhance read performance. EEPH+ employs three techniques to alleviate the aforementioned bottlenecks and improve performance: an extendible hashing technique to reduce the data movement overhead during hash table expansion, a hybrid PM–DRAM layout where the index structure resides in DRAM combined with a complement move algorithm to minimize the random accesses inherent to perfect hashing, and a batching and prefetching scheme to facilitate the parallel execution of hash computations and data accesses across multiple searches, thereby further boosting read performance. We compare EEPH+ with the state-of-the-art hash indexes on PM by conducting comprehensive experiments on several real-world read-intensive and read-skew workloads. The experimental results confirm the superiority of our EEPH+, which outperforms state-of-the-art hash indexes by up to 3.6× in read throughput and 3.14× in 99th percentile latency.