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

Kiran Srinivasan

dblp:75/6352 · DBLP profile ↗
← Back
10ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0003-6805-1293ORCID · corroborated

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

Systems, architecture and hardware · 8 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 2

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
6 papers
Storage systems · 55% Cloud and datacenter computing · 40% Distributed systems · 4%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cloud storage
0.912025
Cloudscape: A Study of Storage Services in Modern Cloud Architectures · FAST 2025
Storage systems
compressed data storage
0.812024
Trinity: A Fast Compressed Multi-attribute Data Store · EuroSys 2024
Storage systems
storage reliability
0.222011
Design implications for enterprise storage systems via multi-dimensional trace analysis · SOSP 2011
Parity Lost and Parity Regained · FAST 2008
Storage systems › data reduction
data deduplication
0.112012
iDedup: latency-aware, inline data deduplication for primary storage · FAST 2012
Storage systems › data reduction › data deduplication
inline deduplication
0.112012
iDedup: latency-aware, inline data deduplication for primary storage · FAST 2012
Storage systems
data placement
0.112011
Design implications for enterprise storage systems via multi-dimensional trace analysis · SOSP 2011
Cloud and datacenter computing › virtualization
inter-VM communication
0.112009
Fido: Fast Inter-Virtual-Machine Communication for Enterprise Appliances · USENIX ATC 2009
Cloud and datacenter computing
virtualization
0.112009
Fido: Fast Inter-Virtual-Machine Communication for Enterprise Appliances · USENIX ATC 2009
Memory systems
cache
0.012011
Design implications for enterprise storage systems via multi-dimensional trace analysis · SOSP 2011
Storage systems › storage reliability
RAID
0.012008
Parity Lost and Parity Regained · FAST 2008

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

compression · 1.5multi-dimensional statistical trace analysis · 0.1
YearPublicationVenuePosition
2025 Cloudscape: A Study of Storage Services in Modern Cloud Architectures
Sambhav Satija, Chenhao Ye, Ranjitha Kosgi, Romit Kankaria, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Kiran Srinivasan
FAST9
2024 Trinity: A Fast Compressed Multi-attribute Data Store
abstract
With the proliferation of attribute-rich machine-generated data, emerging real-time monitoring, diagnosis, and visualization tools ingest and analyze such data across multiple attributes simultaneously. Due to the sheer volume of the data, applications need storage-efficient and performant data representations to analyze them efficiently.
Ziming Mao, Kiran Srinivasan, Anurag Khandelwal
EuroSys2
2016 Tombolo: Performance enhancements for cloud storage gateways
abstract
Object-based cloud storage has been widely adopted for their agility in deploying storage with a very low up-front cost. However, enterprises currently use them to store secondary data and not for expensive primary data. The driving reason is performance; most enterprises conclude that storing primary data in the cloud will not deliver the performance needed to serve typical workloads. Our analysis of real-world traces shows that certain primary data sets can reside in the cloud with its working set cached locally, using a cloud gateway that acts as a caching bridge between local data centers and the cloud. We use a realistic cloud gateway simulator to study the performance and cost of moving such workloads to different cloud backends (like Amazon S3). We find that when equipped with the right techniques, cloud gateways can provide competitive performance and price compared to on-premise storage. We also provide insights on how to build such cloud gateways, especially with respect to caching and prefetching techniques.
Suli Yang, Kiran Srinivasan, Kishore Udayashankar, Swetha Krishnan, Jingxin Feng, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
MSST2
2015 An empirical study of file systems on NVM
abstract
Emerging byte-addressable, non-volatile memory like phase-change memory, STT-MRAM, etc. brings persistence at latencies within an order of magnitude of DRAM, thereby motivating their inclusion on the memory bus. According to some recent work on NVM, traditional file systems are ineffective and sub-optimal in accessing data from this low latency media. However, there exists no systematic performance study across different file systems and their various configurations validating this point. In this work, we evaluate the performance of various legacy Linux file systems under various real world workloads on non-volatile memory (NVM) simulated using ramdisk and compare it against NVM optimized file system - PMFS. Our results show that while the default file system configurations are mostly sub-optimal for NVM, these legacy file systems can be tuned using mount and format options to achieve performance that is comparable to NVM-aware file system such as PMFS. Our experiments show that the performance difference between PMFS and ext2/ext3 with execute-in-place (XIP) option is around 5% for many workloads (TPCC and YCSB). Furthermore, based on the learning from our performance study, we present few key file system features such as in-place update layout with XIP, and parallel metadata and data allocations, etc. that could be leveraged by file system designers to improve performance of both legacy and new file systems for NVM.
Priya Sehgal, Sourav Basu, Kiran Srinivasan, Kaladhar Voruganti
MSST3
2012 iDedup: latency-aware, inline data deduplication for primary storage
Kiran Srinivasan, Timothy Bisson, Garth R. Goodson, Kaladhar Voruganti
FAST1
2011 Design implications for enterprise storage systems via multi-dimensional trace analysis
abstract
Enterprise storage systems are facing enormous challenges due to increasing growth and heterogeneity of the data stored. Designing future storage systems requires comprehensive insights that existing trace analysis methods are ill-equipped to supply. In this paper, we seek to provide such insights by using a new methodology that leverages an objective, multi-dimensional statistical technique to extract data access patterns from network storage system traces. We apply our method on two large-scale real-world production network storage system traces to obtain comprehensive access patterns and design insights at user, application, file, and directory levels. We derive simple, easily implementable, threshold-based design optimizations that enable efficient data placement and capacity optimization strategies for servers, consolidation policies for clients, and improved caching performance for both.
Yanpei Chen, Kiran Srinivasan, Garth R. Goodson, Randy H. Katz
SOSP2
2009 Fido: Fast Inter-Virtual-Machine Communication for Enterprise Appliances
Anton Burtsev, Kiran Srinivasan, Prashanth Radhakrishnan, Kaladhar Voruganti, Garth R. Goodson
USENIX ATC2
2008 Parity Lost and Parity Regained
Andrew Krioukov, Lakshmi N. Bairavasundaram, Garth R. Goodson, Kiran Srinivasan, Randy Thelen, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
FAST4
2002 Migratory TCP: Connection Migration for Service Continuity in the Internet
abstract
Today's Internet services are commonly built over TCP, the standard Internet connection-oriented reliable transport protocol. The endpoint naming scheme of TCP, based on network layer (IP) addresses, creates an implicit binding between a service and the IP address of a server providing it, throughout the lifetime of a client connection. This makes a TCP client prone to all adverse conditions that may affect the server endpoint or the internetwork in between, after the connection is established: congestion or failure in the network, server overloaded, failed or under DoS attack. Studies that quantify the effects of network stability and route availability demonstrate that connectivity failures can significantly impact Internet services. As a result, although highly available servers can be deployed, sustaining continuous service remains a problem. We propose cooperative service model, in which a pool of similar servers, possibly geographically distributed across the Internet, cooperate in sustaining a service by migration of client connections within the pool. The control traffic between servers, needed to support migrated connections, can be carried either over the Internet or over a private network. From client's viewpoint, at any point during the lifetime of its service session, the remote endpoint of its connection may transparently migrate between servers.
Florin Sultan, Kiran Srinivasan, Deepa Iyer, Liviu Iftode
ICDCS2
2001 Transport Layer Support for Highly-Available Network Services
abstract
We advocate a transport layer protocol for highly available network services by means of transparent migration of the server endpoint of a live connection between cooperating servers that provide the same service. We propose a transport protocol that: (i) offers a better alternative than the simple retransmission to the same server, which may be suffering from overload or a DoS attack, may be down, or may not be easily reachable due to congestion; and (ii) decouples a given service from the unique/fixed identity of its provider. Our protocol can be viewed as an extension to the existing TCP, and compatible with it.
Florin Sultan, Kiran Srinivasan, Liviu Iftode
HotOS2