greedy-garbage-collection · shipping · also greedy block cleaning

Greedy garbage collection

A flash block-cleaning policy that selects a candidate erase block with the fewest valid pages, minimizing the valid data copied for that selection.

The candidate set matters: a global greedy policy and a policy restricted to an age window are not the same algorithm. Immediate copying cost does not by itself determine long-run behavior under skewed update frequencies.

Relations

related

garbage-collection, over-provisioning, write-amplification, hot-cold-data-separation

Limitations

• Uniform-write formulas are conditional models, not universal drive predictions. [2, 1]

Citations

1. Luojie Xiang and Brian M. Kurkoski. An Improved Analytic Expression for Write Amplification in NAND Flash. arXiv:1110.4245v1 (19 October 2011), sections II-IV, equation 12 and Table I. (accessed 2026-10-11)
2. Peter Desnoyers. Analytic Modeling of SSD Write Performance. SYSTOR 2012, sections 2-6, Tables 1-2. DOI: 10.1145/2367589.2367603. (accessed 2026-10-11)
3. Hesela: SSD over-provisioning, capacity denominators and analytical-model limits (accessed 2026-10-11)

JSON: /data/terms/greedy-garbage-collection.json