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

Dax Delvira

dblp:390/1536 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0001-8627-5413ORCID · reported

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

Software engineering, systems software and programming languages · 1 · 1 since 2021

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 · 75% Hardware reliability and fault tolerance · 25%

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

TopicWeightPapersLastEvidence papers
Storage systems › file systems
cluster file systems
0.812024
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems · SOSP 2024
Storage systems › storage reliability
erasure coding
0.812024
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems · SOSP 2024
Hardware reliability and fault tolerance › redundancy
redundancy management
0.812024
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems · SOSP 2024
Storage systems
storage reliability
0.812024
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems · SOSP 2024

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

replication · 0.8erasure coding · 0.8convertible codes · 0.8
YearPublicationVenuePosition
2024 Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems
abstract
Many data services tune and change redundancy configurations of files over their lifetimes to address changes in data temperature and latency requirements. Unfortunately, changing redundancy configs (transcode) is IO-intensive. The Morph cluster file system introduces new transcode-efficient redundancy schemes to minimize overheads as files progress through lifetime phases. For newly ingested data, commonly stored via 3-way replication, Morph introduces a hybrid redundancy scheme that combines a replica with an erasure-coded (EC) stripe, reducing both ingest IO and capacity overheads while enabling free transcode to EC by deleting replicas. For subsequent transcodes to wider, more space-efficient EC configs, Morph exploits Convertible Codes, which minimize data read for EC transcode, and introduces new block placement policies to maximize their effectiveness.
Timothy Kim, Sanjith Athlur, Saurabh Kadekodi, Francisco Maturana, Dax Delvira, Arif Merchant, Gregory R. Ganger, K. V. Rashmi
SOSP5