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

Akshat Aranya

dblp:60/3321 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 5 · 1 first-authorDatabases, data management, data science and information retrieval · 5 · 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
5 papers
Distributed systems · 43% Storage systems · 29% Memory systems · 18%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
data consistency
0.422015
Reliable, Consistent, and Efficient Data Sync for Mobile Apps · FAST 2015
Simba: tunable end-to-end data consistency for mobile apps · EuroSys 2015
Distributed systems
data synchronization
0.212015
Reliable, Consistent, and Efficient Data Sync for Mobile Apps · FAST 2015
Storage systems
mobile applications
0.212015
Reliable, Consistent, and Efficient Data Sync for Mobile Apps · FAST 2015
Cloud and datacenter computing
mobile cloud computing
0.212015
Simba: tunable end-to-end data consistency for mobile apps · EuroSys 2015
Distributed systems › consistency models
tunable consistency
0.212015
Simba: tunable end-to-end data consistency for mobile apps · EuroSys 2015
Memory systems › cache management
cache replacement
0.212013
TBF: A memory-efficient replacement policy for flash-based caches · ICDE 2013
Memory systems › cache management › storage caching
flash cache
0.212013
TBF: A memory-efficient replacement policy for flash-based caches · ICDE 2013
Storage systems
file systems
0.222010
HydraFS: A High-Throughput File System for the HYDRAstor Content-Addressable Storage System · FAST 2010
Tracefs: A File System to Trace Them All · FAST 2004
Storage systems
content-addressable storage
0.112010
HydraFS: A High-Throughput File System for the HYDRAstor Content-Addressable Storage System · FAST 2010
Storage systems › file systems
distributed file system
0.112010
HydraFS: A High-Throughput File System for the HYDRAstor Content-Addressable Storage System · FAST 2010
Distributed systems
fault tolerance
0.112015
Simba: tunable end-to-end data consistency for mobile apps · EuroSys 2015
Memory systems
cache management
0.012013
TBF: A memory-efficient replacement policy for flash-based caches · ICDE 2013
Program analysis › dynamic analysis
program tracing
0.012004
Tracefs: A File System to Trace Them All · FAST 2004
Storage systems › i/o workload characterization
file system traces
0.012004
Tracefs: A File System to Trace Them All · FAST 2004

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

bloom filter · 0.2LRU approximation · 0.2
YearPublicationVenuePosition
2015 Simba: tunable end-to-end data consistency for mobile apps
abstract
Developers of cloud-connected mobile apps need to ensure the consistency of application and user data across multiple devices. Mobile apps demand different choices of distributed data consistency under a variety of usage scenarios. The apps also need to gracefully handle intermittent connectivity and disconnections, limited bandwidth, and client and server failures. The data model of the apps can also be complex, spanning inter-dependent structured and unstructured data, and needs to be atomically stored and updated locally, on the cloud, and on other mobile devices.
Dorian Jean Perkins, Nitin Agrawal 0001, Akshat Aranya, Curtis Yu, Younghwan Go, Harsha V. Madhyastha, Cristian Ungureanu
EuroSys3
2015 Reliable, Consistent, and Efficient Data Sync for Mobile Apps
Younghwan Go, Nitin Agrawal 0001, Akshat Aranya, Cristian Ungureanu
FAST3
2013 Mobile Data Sync in a Blink
Nitin Agrawal 0001, Akshat Aranya, Cristian Ungureanu
HotStorage2
2013 TBF: A memory-efficient replacement policy for flash-based caches
abstract
The performance and capacity characteristics of flash storage make it attractive to use as a cache. Recency-based cache replacement policies rely on an in-memory full index, typically a B-tree or a hash table, that maps each object to its recency information. Even though the recency information itself may take very little space, the full index for a cache holding N keys requires at least log N bits per key. This metadata overhead is undesirably high when used for very large flash-based caches, such as key-value stores with billions of objects. To solve this problem, we propose a new RAM-frugal cache replacement policy that approximates the least-recently-used (LRU) policy. It uses two in-memory Bloom sub-filters (TBF) for maintaining the recency information and leverages an on-flash key-value store to cache objects. TBF requires only one byte of RAM per cached object, making it suitable for implementing very large flash-based caches. We evaluate TBF through simulation on traces from several block stores and key-value stores, as well as evaluate it using the Yahoo! Cloud Serving Benchmark in a real system implementation. Evaluation results show that TBF achieves cache hit rate and operations per second comparable to those of LRU in spite of its much smaller memory requirements.
Cristian Ungureanu, Biplob Debnath, Stephen Rago, Akshat Aranya
ICDE4
2013 Building a Delay-Tolerant Cloud for Mobile Data
abstract
Mobile data usage is on a tremendous rise, due not only to increasing number of users but also to an increase in the number of applications that transfer data over the network. Moreover, applications for sharing, sensing, and collaboration have become more popular, causing significant amounts of data to be generated on devices. Managing this data -syncing it to the cloud, or with other users or devices- is a crucial and often challenging part of writing mobile apps and services. In spite of plenty of good advice and best practices from OS vendors and network operators, storing and transferring mobile data is fraught with issues. On the one hand, an app developer needs to worry about the semantics of data storage and synchronization, while on the other, about the end-user experience, which maybe impacted by poor and intermittent network connectivity. To address the needs of the app developers and the end-users, we have built Izzy: a platform to rapidly develop and deploy data-centric mobile apps. Izzy provides well-defined and easy to use semantics for accessing local storage and for synchronizing data with a remote, scalable, global store. Izzy also provides global store access to the cloud-resident part of the applications (if any) through a similar server API. Last but not least, Izzy is designed to be frugal: it conserves mobile device resources by applying delay-tolerance and data reduction techniques (message coalescing and compression) across applications on a mobile device. In this paper we present the design of Izzy and our early experiences with using it.
Nitin Agrawal 0001, Akshat Aranya, Cristian Ungureanu
MDM (1)3
2010 HydraFS: A High-Throughput File System for the HYDRAstor Content-Addressable Storage System
Cristian Ungureanu, Benjamin Atkin, Akshat Aranya, Salil Gokhale, Stephen Rago, Grzegorz Calkowski, Cezary Dubnicki, Aniruddha Bohra
FAST3
2004 Tracefs: A File System to Trace Them All
Akshat Aranya, Charles P. Wright, Erez Zadok
FAST1