Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems
DOI10.1007/S11134-014-9405-YzbMATH Open1323.60096OpenAlexW2079125125MaRDI QIDQ475104FDOQ475104
Authors: Yongkun Li, Patrick P. C. Lee, John C. S. Lui 
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
Recommendations
- A mean field model for a class of garbage collection algorithms in flash-based solid state drives
- Applying mean-field approximation to continuous time Markov chains
- Markovian queue with garbage collection
- Performance modelling and Markov chains
- Approximate mean value analysis based on Markov chain aggregation by composition
mean-field analysiscleaning costgarbage collection algorithmsMarkov chain modelrandomized greedy algorithmsolid-state driveswear-leveling
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cites Work
Cited In (2)
Uses Software
This page was built for publication: Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475104)
