A mean field model for a class of garbage collection algorithms in flash-based solid state drives

DOI10.1007/S11134-014-9403-0MaRDI QIDQ475106zbMATH OpenOpenAlexFDO

Authors Benny Van Houdt

Publication date 25 November 2014

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-014-9403-0

zbMATH Keywords

flash-based solid state drivesgarbage collection algorithmsmean-field modelwrite amplification

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

Recommendations

• Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems
• BAGC: Buffer-Aware Garbage Collection for Flash-Based Storage Systems
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation

Cites work

• Balanced Allocations
• scientific article; zbMATH DE number 1857645 (Why is no real title available?)
• Queueing system with selection of the shortest of two queues: An asymptotic approach

Cited in

(3)

• Markovian queue with garbage collection
• A computational approach to steady-state convergence of fluid limits for Coxian queuing networks with abandonment
• Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems

This page was built for publication: A mean field model for a class of garbage collection algorithms in flash-based solid state drives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475106)