Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
- 31 December 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
Initially used in digital audio players, digital cameras, mobile phones, and USB memory sticks, flash memory may become the dominant form of end-user storage in mobile computing, either completely replacing the magnetic hard disks or being an additional secondary storage. We study the design of algorithms and data structures that can exploit the flash memory devices better. For this, we characterize the performance of NAND flash based storage devices, including many solid state disks. We show that these devices have better random read performance than hard disks, but much worse random write performance. We also analyze the effect of misalignments, aging and past I/O patterns etc. on the performance obtained on these devices. We show that despite the similarities between flash memory and RAM (fast random reads) and between flash disk and hard disk (both are block based devices), the algorithms designed in the RAM model or the external memory model do not realize the full potential of the flash memory devices. We later give some broad guidelines for designing algorithms which can exploit the comparative advantages of both a flash memory device and a hard disk, when used together.Keywords
This publication has 7 references indexed in Scilit:
- A design for high-performance flash disksACM SIGOPS Operating Systems Review, 2007
- Improved external memory BFS implementationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2007
- Algorithms and data structures for flash memoriesACM Computing Surveys, 2005
- An efficient R-tree implementation over flash-memory storage systemsPublished by Association for Computing Machinery (ACM) ,2003
- External-Memory Breadth-First Search with Sublinear I/OLecture Notes in Computer Science, 2002
- A new approach to I/O performance evaluationACM SIGMETRICS Performance Evaluation Review, 1993
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988