Vasily Tarasov

Vasily Tarasov

Auto-generated profile, based on publicly available information

Vasily Tarasov

IBM Research, San Jose, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
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.

1 January 2019 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
VTVasily Tarasov
Vasily Tarasov
LRLukas Rupprecht
Lukas Rupprecht
DSDimitris Skourtis
Dimitris Skourtis
WLWenji Li
Wenji Li
RRRaju Rangaswami
Raju Rangaswami
MZMing Zhao
Ming Zhao

20 November 2019
Verified
Conference Paper
Open access
KLKunal Lillaney
Kunal Lillaney
VTVasily Tarasov
Vasily Tarasov
DPDavid Pease
David Pease
RBRandal Burns
Randal Burns
Object storage is a low-cost, scalable component of cloud ecosystems. However, interface incompatibilities and performance limitations inhibit its adoption for emerging cloud-based workloads. Users are compelled to either run their applications over expensive block storage-based file systems or use inefficient file connectors over object stores. Dual access, the ability to read and write the same data through file systems interfaces and object storage APIs, has promise to improve performance and eliminate storage sprawl. We design and implement Agni1, an efficient, distributed, dual-access object storage file system (OSFS), that uses standard object storage APIs and cloud microservices. Our system overcomes the performance shortcomings of existing approaches by implementing a multi-tier write aggregating data structure and by integrating with existing cloud-native services. Moreover, Agni provides distributed access and a coherent namespace. Our experiments demonstrate that for representative workloads Agni improves performance by 20%--60% when compared with existing approaches.

5 June 2023
Verified
Conference Paper
Open access
AMAlex Merenstein
Alex Merenstein
VTVasily Tarasov
Vasily Tarasov
AAAli Anwar
Ali Anwar
SGScott Guthridge
Scott Guthridge
EZErez Zadok
Erez Zadok
Serverless platforms offer on-demand computation and represent a significant shift from previous platforms that typically required resources to be pre-allocated (e.g., virtual machines). As serverless platforms have evolved, they have become suitable for a much wider range of applications than their original use cases. However, storage access remains a pain point that holds serverless back from becoming a completely generic computation platform. Existing storage for serverless typically uses an object interface. Although object APIs are simple to use, they lack the richness, versatility, and performance of file based APIs. Additionally, there is a large body of existing applications that relies on file-based interfaces. The lack of file based storage options prevents these applications from being ported to serverless environments. In this paper, we present F3, a file system that offers features to improve file access in serverless platforms: (1) efficient handling of ephemeral data, by placing ephemeral and non-ephemeral data on storage that exists at a different points along the durability-performance tradeoff continuum, (2) locality-aware data scheduling, and (3) efficient reading while writing. We modified OpenWhisk to support attaching file-based storage and to leverage F3's features using hints. Our prototype evaluation of F3 shows improved performance of up to 1.5--6.5× compared to existing storage systems.

30 March 2025
Verified
Conference Paper
Open access
AMApoorve Mohan
Apoorve Mohan
RWRobert Walkup
Robert Walkup
BKBengi Karacali
Bengi Karacali
MCMing-Hung Chen
Ming-Hung Chen
AKAbdullah Kayi
Abdullah Kayi
SSSeetharami Seelam
Seetharami Seelam

16 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
JZJingyuan Zhang
Jingyuan Zhang
AWAo Wang
Ao Wang
XMXiaolong Ma
Xiaolong Ma
BCBenjamin Carver
Benjamin Carver
NNNicholas John Newman
Nicholas John Newman
YCYue Cheng
Yue Cheng
Cloud object storage such as AWS S3 is cost-effective and highly elastic but relatively slow, while high-performance cloud storage such as AWS ElastiCache is expensive and provides limited elasticity. We present a new cloud storage service called ServerlessMemory, which stores data using the memory of serverless functions. ServerlessMemory employs a sliding-window-based memory management strategy inspired by the garbage collection mechanisms used in the programming language to effectively segregate hot/cold data and provides fine-grained elasticity, good performance, and a pay-per-access cost model with extremely low cost. We then design and implement InfiniStore, a persistent and elastic cloud storage system, which seamlessly couples the function-based ServerlessMemory layer with a persistent, inexpensive cloud object store layer. InfiniStore enables durability despite function failures using a fast parallel recovery scheme built on the autoscaling functionality of a FaaS (Function-as-a-Service) platform. We evaluate InfiniStore extensively using both microbenchmarking and two real-world applications. Results show that InfiniStore has more performance benefits for objects larger than 10 MB compared to AWS ElastiCache and Anna, and InfiniStore achieves 26.25% and 97.24% tenant-side cost reduction compared to InfiniCache and ElastiCache, respectively.