Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Subil Abraham

dblp:72/4922 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-9537-7251ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author · 2 since 2021Security and privacy · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 80% Cloud and datacenter computing · 20%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › data reduction
data deduplication
1.222024
An End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage Systems · ACM Trans. Storage 2024
DupHunter: Flexible High-Performance Deduplication for Docker Registries · USENIX ATC 2020
Storage systems › storage management
container storage
0.812024
An End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage Systems · ACM Trans. Storage 2024
Storage systems › file systems
copy-on-write
0.812024
An End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage Systems · ACM Trans. Storage 2024
Cloud and datacenter computing
container registry
0.412020
DupHunter: Flexible High-Performance Deduplication for Docker Registries · USENIX ATC 2020

Methods — techniques the papers use, named apart from their topics

locality preservation · 0.8deduplication offloading · 0.8container-aware storage · 0.8
YearPublicationVenuePosition
2024 Evaluating integration and performance of containerized climate applications on a Hewlett Packard Enterprise Cray system
abstract
Summary Containers have taken over large swaths of cloud computing as the most convenient way of packaging and deploying applications. The features that containers offer for packaging and deploying applications translate to high performance computing (HPC) as well. At The National Oceanic and Atmospheric Administration, containers provide an easy way to build and distribute complex HPC applications, allowing faster collaboration, portability, and experiment computer environment reproducibility amongst the scientific community. The challenge arises when applications rely on message passing interface (MPI). This necessitates investigation into how to properly run these applications with their own unique requirements and produce performance on par with native runs. We investigate the MPI performance for benchmarks and containerized climate models for various containers covering selection of compiler and MPI library combinations from the Cray provided programming environments on the Cray XC supercomputer GAEA. Performance from the benchmarks and the climate models shows that for the most part containerized applications perform on par with the natively built applications when the system optimized Cray MPICH libraries are bound into the container, and the hybrid model containers have poor performance in comparison. We also describe several challenges and our solutions in running these containers, particularly challenges with heterogeneous jobs for the containerized model runs.
Subil Abraham, Ryan Prout, Thomas Robinson, Chris Blanton
Concurr. Comput. Pract. Exp.1
2024 An End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage Systems
abstract
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.
Muhui Lin, Hadeel Albahar, Arnab Kumar Paul, Zhijie Huan, Subil Abraham, Vasily Tarasov, Dimitrios Skourtis, Ali Anwar 0001, Ali Raza Butt
ACM Trans. Storage6
2020 On the Use of Containers in High Performance Computing Environments
abstract
The lightweight nature, application portability, and deployment flexibility of containers is driving their widespread adoption in cloud solutions. Data analysis and deep learning (DL)/machine learning (ML) applications have especially benefited from containerization. As such data analysis is adopted in high performance computing (HPC), the need for container support in HPC has become paramount. However, containers face crucial performance and I/O challenges in HPC. One obstacle is that while there have been HPC containers, such solutions have not been thoroughly investigated, especially from the aspect of their impact on the crucial HPC I/O throughput. To this end, this paper provides a first-of-its-kind empirical analysis of state-of-the-art representative container solutions (Docker, Podman, Singularity, and Charliecloud) in HPC environments. We also explore how containers interact with an HPC parallel file system like Lustre. We present the design of an analysis framework that is deployed on all nodes in an HPC environment, and captures CPU, memory, network, and file I/O statistics from the nodes and the storage system. We are able to garner key insights from our analysis, e.g., Charliecloud outperforms other container solutions in terms of container start-up time, while Singularity and Charliecloud are equivalent in I/O throughput. But this comes at a cost, as Charliecloud invokes the most metadata and I/O operations on the underlying Lustre file system. By identifying such trade-offs and optimization opportunities, we can enhance HPC containers performance and the ML/DL applications that increasingly rely on them.
Subil Abraham, Arnab Kumar Paul, Redwan Ibne Seraj Khan, Ali Raza Butt
CLOUD1
2020 DupHunter: Flexible High-Performance Deduplication for Docker Registries
Hadeel Albahar, Subil Abraham, Vasily Tarasov, Dimitrios Skourtis, Lukas Rupprecht, Ali Anwar 0001, Ali Raza Butt
USENIX ATC3
2011 Security architecture for resource-limited environments
abstract
Security in resource-limited environments poses a great challenge as the nodes comprising such a network are severely limited in processing power and storage. Various security protocols have been proposed for sensor networks and RFID that try to mitigate this problem but they provide security on a point-to-point basis which is weak and easily vulnerable to a number of attacks. In this paper, we discuss architecture for a resource limited environment that enables these networks to achieve better security and reliability while being simple and efficient. Based on the architecture we develop non-cryptographic security mechanisms using state machines for providing basic security services including authenticity and confidentiality. We also introduce the concept of Security Fusion where strong system level security properties are synthesized from weak point-to-point security properties. The strengths of these techniques are analysed so as to offer comparisons with conventional techniques.
Suku Nair, Subil Abraham, Omar Al-Ibrahim
IWCMC2
2011 Security Fusion: A New Security Architecture for Resource-Constrained Environments
Suku Nair, Subil Abraham, Omar Al-Ibrahim
HotSec2