MétaCan
Menu
Back to cohort
Record W2081462964 · doi:10.1145/2757667.2757671

Algebraic modeling of write amplification in hotness-aware SSD

2015· article· en· W2081462964 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Storage Technologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsGarbage collectionComputer scienceWorkloadFlash (photography)Metric (unit)GarbageOrdinary differential equationAlgebraic numberComputer engineeringTheoretical computer scienceAlgorithmDifferential equationProgramming languageMathematics

Abstract

fetched live from OpenAlex

Garbage collection is essential to the endurance of NAND flash-based solid state drives (SSDs). Analytic modeling of garbage collection reveals the non-trivial relationship between endurance, a performance metric manifested as write amplification, and the algorithmic design variables, device configurations and workload characteristics. This work builds on recent advances in analytic modeling that targets hotness-aware victim selection algorithms, and improves them using a simpler system of algebraic equations. We show that such a model retains the precision of predicting write amplification, with less than 5% error, while reducing the running time from several hours, as the case in previous model of ordinary differential equations, to merely a few seconds. Equipped with such models, we show how design insights can be obtained to guide performance tuning.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.809
Threshold uncertainty score0.263

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.074
GPT teacher head0.292
Teacher spread0.218 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations7
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Storage TechnologiesFrench-language works237,207