The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
Cleaning policies in mobile computers using flash memory
Journal of Systems and Software
An efficient management scheme for large-scale flash-memory storage systems
Proceedings of the 2004 ACM symposium on Applied computing
Efficient Allocation Algorithms for FLASH File Systems
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
On efficient wear leveling for large-scale flash-memory storage systems
Proceedings of the 2007 ACM symposium on Applied computing
A transactional flash file system for microcontrollers
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
A flash-memory based file system
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Storage alternatives for mobile computers
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Block-based allocation algorithms for FLASH memory in embedded systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
Today, flash memory (a type of semiconductor device) is becoming a popular data storage device in most electronic mobile devices. The reasons that make it become popular include small size and light weight nature, less noise, solid-state reliability, low power consumption, and better shock resistant. However, its two hardware characteristics, called out-place updating and garbage collection indirectly affect the performance of it superiority features. To overcome these limitations, this paper proposes a page allocation algorithm that based on page appearance regularity. The performance of the allocation scheme is confirmed by trace-driven simulations and the merit of the proposed algorithm is justified in terms of the number of active block requirement.