default search action
Saurabh Kadekodi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Phitchaya Mangpo Phothilimthana
, Saurabh Kadekodi
Thesios: Synthesizing Accurate Counterfactual I/O Traces from I/O Samples. ASPLOS (3) 2024: 1016-1032 - [c11]Timothy Kim
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems. SOSP 2024: 330-346 - [c10]Harshad Shirwadkar, Saurabh Kadekodi, Theodore Y. Ts'o:
FastCommit: resource-efficient, performant and cost-effective file system journaling. USENIX ATC 2024: 157-171 - 2023
- [j1]Saurabh Kadekodi
Practical Design Considerations for Wide Locally Recoverable Codes (LRCs). ACM Trans. Storage 19(4): 31:1-31:26 (2023) - [c9]Saurabh Kadekodi, Shashwat Silas, David Clausen, Arif Merchant:
Practical Design Considerations for Wide Locally Recoverable Codes (LRCs). FAST 2023: 1-16 - 2022
- [c8]Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, Gregory R. Ganger:
Tiger: Disk-Adaptive Redundancy Without Placement Restrictions. OSDI 2022: 413-429 - 2021
- [b1]Saurabh Kadekodi:
Disk-Adaptive Redundancy: Tailoring Data Redundancy to Disk-Reliability Heterogeneity in Cluster Storage Systems. Carnegie Mellon University, USA, 2021 - [c7]Rohan Kadekodi, Saurabh Kadekodi, Soujanya Ponnapalli, Harshad Shirwadkar, Gregory R. Ganger, Aasheesh Kolli, Vijay Chidambaram
WineFS: a hugepage-aware file system for persistent memory that ages gracefully. SOSP 2021: 804-818 - [i1]Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger:
PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. CoRR abs/2103.08191 (2021) - 2020
- [c6]Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger:
PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. OSDI 2020: 369-385
2010 – 2019
- 2019
- [c5]Saurabh Kadekodi, K. V. Rashmi, Gregory R. Ganger:
Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity. FAST 2019: 345-358 - 2018
- [c4]Saurabh Kadekodi, Bin Fan, Adit Madan, Garth A. Gibson, Gregory R. Ganger:
A Case for Packing and Indexing in Cloud File Systems. HotCloud 2018 - [c3]Saurabh Kadekodi, Vaishnavh Nagarajan, Gregory R. Ganger:
Geriatrix: Aging what you see and what you don't see. A file system aging approach for modern storage systems. USENIX ATC 2018: 691-704 - 2017
- [c2]Qing Zheng
Software-defined storage for fast trajectory queries using a deltaFS indexed massive directory. PDSW-DISCS@SC 2017: 7-12 - 2015
- [c1]Saurabh Kadekodi, Swapnil Pimpale, Garth A. Gibson:
Caveat-Scriptor: Write Anywhere Shingled Disks. HotStorage 2015
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: