劉邦鋒臺灣大學：資訊工程學研究所周立夫Chou, Li-FuLi-FuChou2007-11-262018-07-052007-11-262018-07-052004http://ntur.lib.ntu.edu.tw//handle/246246/54084Embedded systems have been developing rapidly in recent years, and flash memory technology has become an essential building block because of its shock-resistance, low power consumption, and non-volatile nature. Since flash memory is a write-once and bulk-erase medium, an intelligent allocation algorithm is essential to providing applications efficient storage service. In this paper, we propose three allocation algorithms { a First Come First Serve (FCFS) method, a First Re-arrival First Serve (FRFS) method, and an Online First Re-arrival First Serve (OFRFS) method. Both FCFS and OFRFS are on-line allocation mechanisms which provide a deterministic performance for hard real-time systems. In addition, the FRFS method, which serves as an on-line mechanism, is taken as the standard of comparison. The capability of the proposed mechanisms is demonstrated by a series of experiments and simulations. The experimental results indicate that FRFS provide superior performance when the data access patter is analyzed in advance, and the on-line OFRFS method provides good performance by run-time estimation of access patterns.1 Introduction 5 2 Flash Memory Allocation Model 7 3 Algorithm 10 4 Experimental Results 23 5 Conclusion 31211295 bytesapplication/pdfen-US快閃記憶體儲存格配置algorithmallocationflash memorythesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/54084/1/ntu-93-R91922087-1.pdf