Competitive Analysis of Flash-Memory Algorithms

DOI10.1007/11841036_12MaRDI QIDQ5449520zbMATH OpenOpenAlexFDO

Authors Avraham Ben-Aroya, Sivan Toledo

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11841036_12

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07)

Recommendations

• Competitive analysis of flash memory algorithms
• A competitive analysis for the start-gap algorithm for online memory wear leveling
• Online Paging for Flash Memory Devices
• The optimal structure of algorithms for \(\alpha\)-paging
• Competitive analysis of randomized paging algorithms

Cited in

(6)

• A competitive analysis for the start-gap algorithm for online memory wear leveling
• Algorithmic Building Blocks for Asymmetric Memories
• The online house numbering problem: min-max online list labeling
• Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems
• Competitive analysis of flash memory algorithms
• A hybrid filesystem for hard disk drives in tandem with flash memory

This page was built for publication: Competitive Analysis of Flash-Memory Algorithms

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