Andrea C. Arpaci-Dusseau

Dr. Andrea C. Arpaci-Dusseau

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
3 November 2013
Verified
Conference Paper
Open access
VCVijay Chidambaram
Vijay Chidambaram
TPThanumalayan Sankaranarayana Pillai
Thanumalayan Sankaranarayana Pillai
AAAndrea C. Arpaci-Dusseau
Andrea C. Arpaci-Dusseau
RARemzi Arpaci-Dusseau
Remzi Arpaci-Dusseau
We introduce optimistic crash consistency, a new approach to crash consistency in journaling file systems. Using an array of novel techniques, we demonstrate how to build an optimistic commit protocol that correctly recovers from crashes and delivers high performance. We implement this optimistic approach within a Linux ext4 variant which we call OptFS. We introduce two new file-system primitives, osync() and dsync(), that decouple ordering of writes from their durability. We show through experiments that OptFS improves performance for many workloads, sometimes by an order of magnitude; we confirm its correctness through a series of robustness tests, showing it recovers to a consistent state after crashes. Finally, we show that osync() and dsync() are useful in atomic file system and database update scenarios, both improving performance and meeting application-level consistency demands.

30 March 2025
Verified
Conference Paper
Open access
SZShawn Wanxiang Zhong
Shawn Wanxiang Zhong
JLJing Liu
Jing Liu
AAAndrea C. Arpaci-Dusseau
Andrea C. Arpaci-Dusseau
RARemzi Arpaci-Dusseau
Remzi Arpaci-Dusseau

28 August 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
IKIbrahim Kettaneh
Ibrahim Kettaneh
AAAhmed Alquraan
Ahmed Alquraan
HTHatem Takruri
Hatem Takruri
SYSuli Yang
Suli Yang
AAAndrea C. Arpaci-Dusseau
Andrea C. Arpaci-Dusseau
SASamer Al-Kiswany
Samer Al-Kiswany
We present NICE, a key-value storage system design that leverages new software-defined network capabilities to build cluster-based network-efficient storage system. NICE presents novel techniques to co-design network routing and multicast with storage replication, consistency, and load balancing to achieve higher efficiency, performance, and scalability. We implement the NICEKV prototype. NICEKV follows the NICE approach in designing four essential network-centric storage mechanisms: request routing, replication, consistency, and load balancing. Our evaluation shows that the proposed approach brings significant performance gains compared with the current systems design: up to 7× put/get performance improvement, up to 2× reduction in network load, 3× to 9× load reduction on the storage nodes, and the elimination of scalability bottlenecks present in current designs.

31 August 2022 in ACM Transactions on Storage
Verified
Journal Article
Open access
AGAishwarya Ganesan
Aishwarya Ganesan
RARamnatthan Alagappan
Ramnatthan Alagappan
ARAnthony Rebello
Anthony Rebello
AAAndrea C. Arpaci-Dusseau
Andrea C. Arpaci-Dusseau
RARemzi Arpaci-Dusseau
Remzi Arpaci-Dusseau
Do some storage interfaces enable higher performance than others? Can one identify and exploit such interfaces to realize high performance in storage systems? This article answers these questions in the affirmative by identifying nil-externality , a property of storage interfaces. A nil-externalizing (nilext) interface may modify state within a storage system but does not externalize its effects or system state immediately to the outside world. As a result, a storage system can apply nilext operations lazily, improving performance. In this article, we take advantage of nilext interfaces to build high-performance replicated storage. We implement Skyros , a nilext-aware replication protocol that offers high performance by deferring ordering and executing operations until their effects are externalized. We show that exploiting nil-externality offers significant benefit: For many workloads, Skyros provides higher performance than standard consensus-based replication. For example, Skyros offers 3× lower latency while providing the same high throughput offered by throughput-optimized Paxos.

6 March 2023 in ACM Transactions on Storage
Verified
Journal Article
Open access
SYSuli Yang
Suli Yang
JLJing Liu
Jing Liu
AAAndrea C. Arpaci-Dusseau
Andrea C. Arpaci-Dusseau
RARemzi Arpaci-Dusseau
Remzi Arpaci-Dusseau
In this article, we present an approach to systematically examine the schedulability of distributed storage systems, identify their scheduling problems, and enable effective scheduling in these systems. We use Thread Architecture Models (TAMs) to describe the behavior and interactions of different threads in a system, and show both how to construct TAMs for existing systems and utilize TAMs to identify critical scheduling problems. We specify three schedulability conditions that a schedulable TAM should satisfy: completeness, local enforceability, and independence; meeting these conditions enables a system to easily support different scheduling policies. We identify five common problems that prevent a system from satisfying the schedulability conditions, and show that these problems arise in existing systems such as HBase, Cassandra, MongoDB, and Riak, making it difficult or impossible to realize various scheduling disciplines. We demonstrate how to address these schedulability problems using both direct and indirect solutions, with different trade-offs. To show how to apply our approach to enable scheduling in realistic systems, we develop Tamed-HBase and Muzzled-HBase, sets of modifications to HBase that can realize the desired scheduling disciplines, including fairness and priority scheduling, even when presented with challenging workloads.

8 July 2024
Verified
Conference Paper
Open access
JLJing Liu
Jing Liu
XHXiangpeng Hao
Xiangpeng Hao
AAAndrea C. Arpaci-Dusseau
Andrea C. Arpaci-Dusseau
RARemzi Arpaci-Dusseau
Remzi Arpaci-Dusseau
TCTej Chajed
Tej Chajed
We present Robust Alternative Execution (RAE), an approach to transparently mask runtime errors in performance-oriented filesystems via temporarily executing an alternative shadow filesystem. A shadow filesystem has the primary goal of robustness, achieved through a simple implementation without performance optimizations and concurrency while adhering to the same API and on-disk formats as the base filesystem it enhances. While the base performance-oriented filesystem may contain bugs, the shadow implementation is formally verified, leveraging advancements in the verification of low-level systems code. In the common case, the base filesystem executes and delivers high performance to applications; however, when a bug is triggered, the slow-but-correct shadow takes over, updates state correctly, and then resumes the base, thus providing high availability.