A fast start-up technique for flash memory based computing systems
Proceedings of the 2005 ACM symposium on Applied computing
Algorithms and data structures for flash memories
ACM Computing Surveys (CSUR)
A superblock-based flash translation layer for NAND flash memory
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Performance improvement of block based NAND flash translation layer
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Design tradeoffs for SSD performance
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
A New FTL-based Flash Memory Management Scheme with Fast Cleaning Mechanism
ICESS '08 Proceedings of the 2008 International Conference on Embedded Software and Systems
μ-FTL:: a memory-efficient flash translation layer supporting multiple mapping granularities
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
FTL design exploration in reconfigurable high-performance SSD for server applications
Proceedings of the 23rd international conference on Supercomputing
A flash translation layer for huge-capacity flash memory storage systems
AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
A survey of Flash Translation Layer
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Unlike a magnetic disk, a flash drive needs no seek time when performing random access. In addition, the read speed of a flash drive is faster than the write speed, and the write speed depends on the I/O request size: the bigger the request size, the faster the write speed. System hibernation stores the machine status completely in non-volatile memory. When the system reboots, the data will be reloaded to the machine, and the system status will be recovered completely. The user can continue immediately where they stopped the last time. We use the characteristic that the flash drives requires no seek time when performing random access to write the data in the memory to swap space or a hibernation file, or simply discard it without any I/O. The write process will try to combine random small writes into continuous large writes, if possible, to optimize the write speed. When the system resumes, it only reloads the data that the user needs, and the resume technique is based on paging on demand. Paging on demand is actually a kind of random access; however, since the flash drive requires no seek time, it does not drag down the system response time due to reducing the number of I/O.