Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems

DOI10.1007/s11134-014-9405-yzbMath1323.60096OpenAlexW2079125125MaRDI QIDQ475104

John C. S. Lui, Patrick P. C. Lee, Yongkun Li

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-9405-y

zbMATH Keywords

mean-field analysiscleaning costgarbage collection algorithmsMarkov chain modelrandomized greedy algorithmsolid-state driveswear-leveling

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Uses Software

• DiskSim

Cites Work

• A mean field model for a class of garbage collection algorithms in flash-based solid state drives
• On-Demand Block-Level Address Mapping in Large-Scale NAND Flash Storage Systems
• Competitive Analysis of Flash-Memory Algorithms

This page was built for publication: Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems