RIFFS: Reverse Indirect Flash File System

This project presents a new technique for flash storage management called a Reverse-Indirect Flash File System (RIFFS). However, flash memories have a drawback: its data cannot be updated-in-place. To solve this limitation, the data is stored inside of the proper file. The solution was to construct a reverse-tree. This would be impracticable with the current systems, because it would not be possible to locate a file directly, from root directory. This schema would break the navigability of the system, and then a direct tree need to be constructed in RAM memory. This article shows the reverse-tree management schema to solve the limitations of flash memories. This solution helped to minimize extreme updates and write operations, increasing flash life-time.

[1]  Ruei-Chuan Chang,et al.  Managing flash memory in personal communication devices , 1997, ISCE '97. Proceedings of 1997 IEEE International Symposium on Consumer Electronics (Cat. No.97TH8348).

[2]  David L. Tennenhouse,et al.  Proactive computing , 2000, Commun. ACM.

[3]  Robert S. Fabry,et al.  A fast file system for UNIX , 1984, TOCS.

[4]  S. Grossman Future trends in flash memories , 1996, IEEE International Workshop on Memory Technology, Design and Testing,.

[5]  David Woodhouse,et al.  JFFS : The Journalling Flash File System , 2001 .

[6]  Tei-Wei Kuo,et al.  A Real-Time Garbage Collection Mechanism for Flash-Memory Stroage Systems in Embedded Systems , 2002 .

[7]  Hiroshi Motoda,et al.  A Flash-Memory Based File System , 1995, USENIX.

[8]  Michael Wu,et al.  eNVy: a non-volatile, main memory storage system , 1994, ASPLOS VI.

[9]  Ruei-Chuan Chang,et al.  Cleaning policies in mobile computers using flash memory , 1999, J. Syst. Softw..

[10]  Mendel Rosenblum,et al.  The design and implementation of a log-structured file system , 1991, SOSP '91.