Competitive analysis of flash memory algorithms

DOI10.1145/1921659.1921669MaRDI QIDQ3189005zbMATH OpenOpenAlexFDO

Authors Avraham Ben-Aroya, Sivan Toledo

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1921659.1921669

zbMATH Keywords

online algorithmscompetitive analysisflash memorieswear leveling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) 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
• Competitive analysis of randomized paging algorithms
• The optimal structure of algorithms for \(\alpha\)-paging

Cited in

(3)

• A competitive analysis for the start-gap algorithm for online memory wear leveling
• 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 Q3189005)