1. Flash memory File system organisation issues Nick Gaens

2. Introduction Technologies How does it work? Limitations File systems: problems and workarounds Outline

3. Flash memory is a non-volatile computer storage chip that can be electrically erased and reprogrammed. – Wikipedia Quick introduction

4. Usage: almost everywhere. Latest trend: SSD’s, successors of HDD’s. Quick introduction SSDHDD PerformanceHighAverage Access timeLowAverage Cost ($/GB)HighLow Life expectancyLowAverage

5. Overall level of research activity: quite low. How come?Extremely low cost-effective due to expensiveness and low life expectancy. Recent:on the rise (IBM’s nanocrystals, terabyte thumb drives …). Quick introduction

6. NANDNOR ArchitectureExtremely high cell densitiesSmall amount of unstructured cells Primary usageData storageCode storage (eXecute In Place) AddressabilityBlocks, Serial I/O interfaceBytes, SRAM PerformanceFaster write and eraseFaster read, very slow erase Problems10 6 cycles, bit flipping10 5 cycles, bit flipping CostLower price tagHigher price tag Technologies

7. SLCMLC StorageSingle bit per cellTwo bits per cell CostHigher cost per bitLower cost per bit Endurance10 5 cycles10 4 cycles ApplicationIndustrial environmentsCommercial products Technologies

8. NAND chip consists of blocks consisting of pages. Block: smallest unit of erase operation Page: smallest unit of read / write operation How does it work?

9. Each page has one of the next statuses: “alive” (contains new, valid data), “dead” (contains old data) or “free” (can be written to). How does it work?

10. Data is written on each page once, thus no rewrite of data in the same location. So updating data requires: 1.find a new page, write data in it and mark it “alive”; 2.mark the previous page as “dead”. Problem:data wasn’t actually erased, so free space is worn out. How does it work?

11. Garbage collector converts “dead” pages to “free” ones. So erasing data requires: 1.read all “alive” pages of a block; 2.write them all to an empty block; 3.delete the contents of the entire block of 1. and mark it as “free”. How does it work?

12. A block can endure a limited amount (10 6 ) of erase cycles before becoming unusable. How to expand the lifetime of flash drives? Introduction of a wear-leveling policy which spreads out erase operations on all blocks of the memory. Limitations

13. The erase operation is very slow, due to the composition of three required steps. How slow? 5 times slower than reading, 2 times slower than writing. Impact on flash database design: effect on usage of tree structures (e.g. B+-Tree’s). Limitations

14. Traditional file systems (such as NTFS, FAT(32), HFS(+), UDF and ext2/3/4) are most frequently found to be used with disk based data storage devices (HDD’s, DVD’s). Using these FS’s on flash based storage devices is quite opportunistic and cheap, though naïve, minimizing performance gains and lowering flash memory’s lifetime. File systems

15. How come? Erase operation of flash memory is explicit and expensive, thus better scheduled when idling. (Disks don’t require such scheduling at all.) File systems

16. How come? Flash memory devices impose no seek latency, thus randomly accessing memory locations doesn’t cause a performance disaster. Disk file systems are however optimized to avoid disk seeks whenever possible, due to the high cost of seeking on disk based devices. File systems

17. How come? Flash memory devices tend to wear out when a single block is repeatedly overwritten. Wear-leveling: a necessity. (Flash file systems are designed to spread out writes evenly.) File systems

18. Adapt the existing FS’s by adding a layer on top of them, the Flash Translation Layer. This layer takes care of the introduced constraints and restrictions of flash memory. Workarounds

19. Log-structured File System Conventional file systems: great care for spatial locality and in-place changes to their data structures (due to slow seeking of magnetic disks). Hypothesis: an ever-increasing amount of system memory makes the above obsolete. Workarounds

20. Log-structured File System A lot of available system memory would lead to I/O becoming extremely write-heavy. (Reads can be done from memory cache.) How to exploit this (hypothetical) situation? Workarounds

21. Log-structured File System Treating storage as a circular log and writing sequentially to the head of that log to maximize the write throughput. (Positive side effects of this technique are snapshotting, improved crash recovery and tampering the GC by divide and conquer.) Workarounds

22. Workarounds remain what they are … just workarounds. A native flash file system can by-design provide an environment in which the performance isn’t limited by any ‘extra’. (Examples are JFFS(2), YAFFS, TrueFFS and ExtremeFFS.) Workarounds

23. However, in practice, flash file systems are only used for "Memory Technology Devices“. MTD’s are embedded flash memories that do not have a controller which takes care of the FTL or any other workarounds. Most commercial flash memories do have such a controller. (E.g. SD, SSD) Flash file system

24. These controllers remain to offer increasing levels of performance, causing the call for applying a native flash file systems to be silenced. Also, benchmarks that directly compare flash FS’s to traditional ones cannot be done that easily. Flash file system

25. Flash memory provides new levels of raw performance to storage techniques, although they do have some issues / caveats. Increasing affordability and feasibility of consumer-leveled flash-based mass storage devices. Consequence: ‘naked’ file systems are quite dumb when it comes to interfacing with flash memory. Conclusions

26. Solution (?) by providing all sorts of high- performance workarounds that take care of the issues mentioned before. Native flash file systems don’t need such workarounds at all, making them attractive. In practice, those flash FS’s are of little use, due to their requirement of the absence of e.g. controllers. Conclusions

27. How many of you do own an SSD? Are you aware of the limited lifetime expectancy of such devices? Discussion

28. Co-presentation: need of advanced data structures for allowing Game AI algorithms to perform faster on e.g. range queries for large amounts of NPC’s. Underlaying cause of this need is the lack of high-performance mass data storage. Does the uprise of flash memory make this research obsolete? Discussion