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

Swetha Krishnan

dblp:23/6826 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

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
1 paper
Storage systems · 67% Distributed systems · 33%
Software engineering, system software, and programming languages
1 paper
Operating systems · 50% Software maintenance and evolution · 50%

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

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
fault detection and recovery
0.112007
Improving file system reliability with I/O shepherding · SOSP 2007
Storage systems › storage reliability
file system reliability
0.112007
Improving file system reliability with I/O shepherding · SOSP 2007
Storage systems
storage reliability
0.112007
Improving file system reliability with I/O shepherding · SOSP 2007
Software maintenance and evolution › software configuration management
consistency management
0.012007
Improving file system reliability with I/O shepherding · SOSP 2007
Operating systems › resource management › storage management
file systems
0.012007
Improving file system reliability with I/O shepherding · SOSP 2007

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

sanity checks · 0.1retry · 0.1parity · 0.1mirrors · 0.1data structure repairs · 0.1checksums · 0.1checksum · 0.1
YearPublicationVenuePosition
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
MSST4
2007 Improving file system reliability with I/O shepherding
abstract
We introduce a new reliability infrastructure for file systems called I/O shepherding. I/O shepherding allows a file system developer to craft nuanced reliability policies to detect and recover from a wide range of storage system failures. We incorporate shepherding into the Linux ext3 file system through a set of changes to the consistency management subsystem, layout engine, disk scheduler, and buffer cache. The resulting file system, CrookFS, enables a broad class of policies to be easily and correctly specified. We implement numerous policies, incorporating data protection techniques such as retry, parity, mirrors, checksums, sanity checks, and data structure repairs; even complex policies can be implemented in less than 100 lines of code, confirming the power and simplicity of the shepherding framework. We also demonstrate that shepherding is properly integrated, adding less than 5% overhead to the I/O path.
Haryadi S. Gunawi, Vijayan Prabhakaran, Swetha Krishnan, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
SOSP3