ripq · research · also RIPQ

Restricted Insertion Priority Queue (RIPQ)

RIPQ is a flash-cache framework that approximates priority ordering through a limited set of buffered insertion points.

Virtual blocks record priority increases in memory; selected objects are copied later when their physical block is reclaimed. This coalesces updates but can still cause host writes. [1]

Relations

related
Write amplification, Write combining, GreedyDual-Size

Limitations

  • The original design targets static objects: arbitrary object deletion and overwrite are unsupported. Historical photo-trace results are not predictions for a different device or workload. [1]

Citations

  1. Tang et al. RIPQ: Advanced Photo Caching on Flash for Facebook. FAST 2015, pp. 373-386; sections 4.2-4.4 and 6.1-6.2. (accessed 2026-11-14)

Further reading

  1. Hesela: cache writes and device writes use different denominators (accessed 2026-11-14)
Sources & caveats
  • Primary-source synthesis; no RIPQ implementation or trace replay performed.

JSON: /data/terms/ripq.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Restricted Insertion Priority Queue (RIPQ). Hesela. 2026-11-14. https://hesela.dev/terms/ripq/