Ali Anwar

Ali Anwar

Auto-generated profile, based on publicly available information

Ali Anwar

University of Minnesota

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 October 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
NZNannan Zhao
Nannan Zhao
VTVasily Tarasov
Vasily Tarasov
HAHadeel Albahar
Hadeel Albahar
AAAli Anwar
Ali Anwar
LRLukas Rupprecht
Lukas Rupprecht
ABAli R. Butt
Ali R. Butt
Docker containers have become a prominent solution for supporting modern enterprise applications due to the highly desirable features of isolation, low overhead, and efficient packaging of the application's execution environment. Containers are created from images which are shared between users via a registry. The amount of data registries store is massive. For example, Docker Hub, a popular public registry, stores at least half a million public images. In this article, we analyze over 167 TB of uncompressed Docker Hub images, characterize them using multiple metrics and evaluate the potential of file-level deduplication. Our analysis helps to make conscious decisions when designing storage for containers in general and Docker registries in particular. For example, only 3 percent of the files in images are unique while others are redundant file copies, which means file-level deduplication has a great potential to save storage space. Furthermore, we carry out a comprehensive analysis of both small I/O request performance and copy-on-write performance for multiple popular container storage drivers. Our findings can motivate and help improve the design of data reduction and caching methods for images, pulling optimizations for registries, and storage drivers.

1 November 2022
Verified
Conference Paper
Closed access
SYSixing Yu
Sixing Yu
PNPhuong Nguyen
Phuong Nguyen
WAWaqwoya Abebe
Waqwoya Abebe
WQWei Qian
Wei Qian
AAAli Anwar
Ali Anwar
AJAli Jannesari
Ali Jannesari
Federated learning (FL) facilitates the training and deploying AI models on edge devices. Preserving user data privacy in FL introduces several challenges, including expensive communication costs, limited resources, and data heterogeneity. In this paper, we propose SPATL, an FL method that addresses these issues by: (a) introducing a salient parameter selection agent and communicating selected parameters only; (b) splitting a model into a shared encoder and a local predictor, and transferring its knowledge to heterogeneous clients via the locally customized predictor. Additionally, we leverage a gradient control mechanism to further speed up model convergence and increase robustness of training processes. Experiments demonstrate that SPATL reduces communication overhead, accelerates model inference, and enables stable training processes with better results compared to state-of-the-art methods. Our approach reduces communication cost by up to 86.45%, accelerates local inference by reducing up to 39.7% FLOPs on VGG-11, and requires 7.4× less communication overhead when training ResNet-20. 1 1 Code is available at: https://github.com/yusx-swapp/SPATL

22 April 2024
Verified
Conference Paper
Open access
AKAhmad Faraz Khan
Ahmad Faraz Khan
ASAhmed M. A. Sayed
Ahmed M. A. Sayed
SFSamuel Fountain
Samuel Fountain
ABAli R. Butt
Ali R. Butt
AAAli Anwar
Ali Anwar
Federated Learning (FL) has emerged as a powerful approach that enables collaborative distributed model training without the need for data sharing. However, FL grapples with inherent heterogeneity challenges leading to issues such as stragglers, dropouts, and performance variations. Selection of clients to run an FL instance is crucial, but existing strategies introduce biases and participation issues and do not consider resource efficiency. Communication and training acceleration solutions proposed to increase client participation also fall short due to the dynamic nature of system resources. We address these challenges in this paper by designing FLOAT, a novel framework designed to boost FL client resource awareness. FLOAT optimizes resource utilization dynamically for meeting training deadlines, and mitigates stragglers and dropouts through various optimization techniques; leading to enhanced model convergence and improved performance. FLOAT leverages multi-objective Reinforcement Learning with Human Feedback (RLHF) to automate the selection of the optimization techniques and their configurations, tailoring them to individual client resource conditions. Moreover, FLOAT seamlessly integrates into existing FL systems, maintaining non-intrusiveness and versatility for both asynchronous and synchronous FL settings. As per our evaluations, FLOAT increases accuracy by up to 53%, reduces client dropouts by up to 78×, and improves communication, computation, and memory utilization by up to 81×, 44×, and 20× respectively.

6 June 2024 in ACM Transactions on Storage
Verified
Journal Article
Open access
NZNannan Zhao
Nannan Zhao
MLMuhui Lin
Muhui Lin
HAHadeel Albahar
Hadeel Albahar
APArnab K. Paul
Arnab K. Paul
ZHZhijie Huang
Zhijie Huang
ABAli R. Butt
Ali R. Butt
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.

14 November 2024 in Future Internet
Verified
Journal Article
Open access
PDF file
ASAhmed M. A. Sayed
Ahmed M. A. Sayed
Mona JaberMona Jaber
Mona Jaber
AAAli Anwar
Ali Anwar
YZYuchao Zhang
Yuchao Zhang
GMGAO Mingliang
GAO Mingliang
Nowadays, Edge Intelligence has seen unprecedented growth in most of our daily life applications. Traditionally, most applications required significant efforts into data collection for data-driven analytics, raising privacy concerns. The proliferation of specialized hardware on sensors, wearable, mobile, and IoT devices has led to the growth of Edge Intelligence, which has become an integral part of the development cycle of most modern applications. However, scalability issues hinder their wide-scale adoption. We aim to focus on these challenges and propose a scalable decentralized edge intelligence framework. Therefore, we analyze and empirically evaluate the challenges of existing methods, and design an architecture that overcomes these challenges. The proposed approach is client-driven and model-centric, allowing models to be shared between entities in a scalable fashion. We conduct experiments over various benchmarks to show that the proposed approach presents an efficient alternative to the existing baseline method, and it can be a viable solution to scale edge intelligence.

30 March 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AAAli Anwar
Ali Anwar
YCYue Cheng
Yue Cheng
HHHai Huang
Hai Huang
JHJingoo Han
Jingoo Han
HSHyogi Sim
Hyogi Sim
ABAli R. Butt
Ali R. Butt
Enterprise KV stores are often not well suited for HPC applications, and thus cumbersome end-to-end KV design customization is required to meet the needs of modern HPC applications. To this end, in this article we present bespoKV, an adaptive, extensible, and scale-out KV store framework. bespoKV decouples the KV store design into the control plane for distributed management and the data plane for local data store. For the control plane, bespoKVprovides pre-built modules, called controlets, supporting common distributed functionalities (e.g., replication, consistency, and topology) and their various combinations. This decoupling allows bespoKV to take a user-provided single-server KV store, called a datalet, and transparently enables a scalable and fault-tolerant distributed KV store service. The resulting distributed stores are also adaptive to consistency or topology requirement changes and can be easily extended for new types of services. Such specializations enable innovative uses of KV stores in HPC applications, especially for emerging applications that utilize KV-friendly workloads. We evaluate bespoKV in a local testbed as well as in a public cloud settings. Experiments show that bespoKV-enabled distributed KV stores scale horizontally to a large number of nodes, and performs comparably and sometimes 1.2× to 2.6× better than the state-of-the-art systems.