Hadeel Albahar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hadeel Albahar has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Ali Raza Butt
Virginia Tech, Blacksburg, Virginia, USA
3 shared publications - Nannan Zhao
School of Science, Chang’an University, Xi’an, People’s Republic of China
3 shared publications - Redwan Ibne Seraj Khan
Virginia Tech, Blacksburg, Virginia, USA
2 shared publications - Ali Anwar
University of Minnesota
1 shared publication - Arnab Kumar Paul
BITS Pilani, KK Birla Goa Campus, Sancaole, India
1 shared publication - Changsheng Xie
Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, China
1 shared publication
Latest Publications
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 320-333
10C ache : Heterogeneous Resource-Aware Tensor Caching and Migration for LLM Training
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 320-333
Open Access10C ache : Heterogeneous Resource-Aware Tensor Caching and Migration for LLM Training
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 557-570
Hybrid Learning and Optimization-Based Dynamic Scheduling for DL Workloads on Heterogeneous GPU Clusters
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 557-570
Open AccessHybrid Learning and Optimization-Based Dynamic Scheduling for DL Workloads on Heterogeneous GPU Clusters
- Open Access
- 6 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 20 (3) , 1-35
An End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage Systems
The wide adoption of Docker containers for supporting agile and elastic enterprise applications has led to a broad proliferation of container images. The associated storage performance and capacity requirements place a high pressure on the infrastructure of container registries that store and distribute images and container storage systems on the Docker client side that manage image layers and store ephemeral data generated at container runtime. The storage demand is worsened by the large amount of duplicate data in images. Moreover, container storage systems that use Copy-on-Write (CoW) file systems as storage drivers exacerbate the redundancy. Exploiting the high file redundancy in real-world images is a promising approach to drastically reduce the growing storage requirements of container registries and improve the space efficiency of container storage systems. However, existing deduplication techniques significantly degrade the performance of both registries and container storage systems because of data reconstruction overhead as well as the deduplication cost. We propose DupHunter, an end-to-end deduplication scheme that deduplicates layers for both Docker registries and container storage systems while maintaining a high image distribution speed and container I/O performance. DupHunter is divided into three tiers: registry tier, middle tier, and client tier. Specifically, we first build a high-performance deduplication engine at the registry tier that not only natively deduplicates layers for space savings but also reduces layer restore overhead. Then, we use deduplication offloading at the middle tier to eliminate the redundant files from the client tier and avoid bringing deduplication overhead to the clients. To further reduce the data duplicates caused by CoWs and improve the container I/O performance, we utilize a container-aware storage system at the client tier that reserves space for each container and arranges the placement of files and their modifications on the disk to preserve locality. Under real workloads, DupHunter reduces storage space by up to 6.9× and reduces the GET layer latency up to 2.8× compared to the state-of-the-art. Moreover, DupHunter can improve the container I/O performance by up to 93% for reads and 64% for writes.
- 6 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 20 (3) , 1-35
Open AccessAn End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage Systems
The wide adoption of Docker containers for supporting agile and elastic enterprise applications has led to a broad proliferation of container images. The associated storage performance and capacity requirements place a high pressure on the infrastructure of container registries that store and distribute images and container storage systems on the Docker client side that manage image layers and store ephemeral data generated at container runtime. The storage demand is worsened by the large amount of duplicate data in images. Moreover, container storage systems that use Copy-on-Write (CoW) file systems as storage drivers exacerbate the redundancy. Exploiting the high file redundancy in real-world images is a promising approach to drastically reduce the growing storage requirements of container registries and improve the space efficiency of container storage systems. However, existing deduplication techniques significantly degrade the performance of both registries and container storage systems because of data reconstruction overhead as well as the deduplication cost. We propose DupHunter, an end-to-end deduplication scheme that deduplicates layers for both Docker registries and container storage systems while maintaining a high image distribution speed and container I/O performance. DupHunter is divided into three tiers: registry tier, middle tier, and client tier. Specifically, we first build a high-performance deduplication engine at the registry tier that not only natively deduplicates layers for space savings but also reduces layer restore overhead. Then, we use deduplication offloading at the middle tier to eliminate the redundant files from the client tier and avoid bringing deduplication overhead to the clients. To further reduce the data duplicates caused by CoWs and improve the container I/O performance, we utilize a container-aware storage system at the client tier that reserves space for each container and arranges the placement of files and their modifications on the disk to preserve locality. Under real workloads, DupHunter reduces storage space by up to 6.9× and reduces the GET layer latency up to 2.8× compared to the state-of-the-art. Moreover, DupHunter can improve the container I/O performance by up to 93% for reads and 64% for writes.
- Open Access
- 1 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 125-134
Building A Fast and Efficient LSM-tree Store by Integrating Local Storage with Cloud Storage
The explosive growth of modern web-scale applications has made cost-effectiveness a primary design goal for their underlying databases. As a backbone of modern databases, LSM-tree based key-value stores (LSM store) face limited storage options. They are either designed for local storage that is relatively small, expensive, and fast or for cloud storage that offers larger capacities at reduced costs but slower. Designing an LSM store by integrating local storage with cloud storage services is a promising way to balance the cost and performance. However, such design faces challenges such as data reorganization and metadata overhead issues. In this paper, we propose ROCKSMASH, a fast and efficient LSM store that uses local storage to store frequently accessed data and metadata while using cloud to hold the rest of the data to achieve cost-effectiveness. To improve metadata space-efficiency and read performance, ROCKSMASH uses an LSM-aware persistent cache that stores metadata in a space-efficient way and stores popular data blocks by using compaction-aware layouts. We implemented ROCKSMASH by embedding these designs into RocksDB. The evaluation results show that ROCKSMASH improves the performance by up to 1.7 × compared to the state-of-the-art schemes and delivers higher reliability and cost-effectiveness.
- 1 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 125-134
Open AccessBuilding A Fast and Efficient LSM-tree Store by Integrating Local Storage with Cloud Storage
The explosive growth of modern web-scale applications has made cost-effectiveness a primary design goal for their underlying databases. As a backbone of modern databases, LSM-tree based key-value stores (LSM store) face limited storage options. They are either designed for local storage that is relatively small, expensive, and fast or for cloud storage that offers larger capacities at reduced costs but slower. Designing an LSM store by integrating local storage with cloud storage services is a promising way to balance the cost and performance. However, such design faces challenges such as data reorganization and metadata overhead issues. In this paper, we propose ROCKSMASH, a fast and efficient LSM store that uses local storage to store frequently accessed data and metadata while using cloud to hold the rest of the data to achieve cost-effectiveness. To improve metadata space-efficiency and read performance, ROCKSMASH uses an LSM-aware persistent cache that stores metadata in a space-efficient way and stores popular data blocks by using compaction-aware layouts. We implemented ROCKSMASH by embedding these designs into RocksDB. The evaluation results show that ROCKSMASH improves the performance by up to 1.7 × compared to the state-of-the-art schemes and delivers higher reliability and cost-effectiveness.