• Title/Summary/Keyword: 순위별 지움 정책

Search Result 2, Processing Time 0.016 seconds

A Ranking Cleaning Policy for Flash Memory Management (플래시 메모리 관리를 위한 순위별 지움 정책)

  • Kim, Jeong-Ki;Park, Sung-Min;Kim, Chae-Kyu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11a
    • /
    • pp.497-500
    • /
    • 2002
  • 본 논문에서는 이동 컴퓨터 등에서 사용되는 플래시 메모리 관리를 위해 새로운 순위별 지움 정책을 제안하고 성능평가를 실시한다. 지움 정책의 일반적인 역할은 플래시 메모리 공간의 어디를 언제 지울 것인가를 결정한다. 제안된 순위별 지움 정책은 지우는 비용과 한정된 지움 회수를 고려하여 지우는 공간과 시간을 결정함으로써 플래시 메모리의 수명을 최대한 연장하고 플래시 메모리 접근 및 관리의 성능을 항상 시킨다. 제안된 방법은 기존의 방법에 비해 저장 연산 수행에서 10%$\sim$50%의 성능 향상을 보인다.

  • PDF

A Ranking Cleaning Policy for Embedded Flash File Systems (임베디드 플래시 파일시스템을 위한 순위별 지움 정책)

  • Kim, Jeong-Ki;Park, Sung-Min;Kim, Chae-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.399-404
    • /
    • 2002
  • Along the evolution of information and communication technologies, manufacturing embedded systems such as PDA (personal digital assistant), HPC (hand -held PC), settop box. and information appliance became realistic. And RTOS (real-time operating system) and filesystem have been played essential re]os within the embedded systems as well. For the filesystem of embedded systems, flash memory has been used extensively instead of traditional hard disk drives because of embedded system's requirements like portability, fast access time, and low power consumption. Other than these requirements, nonvolatile storage characteristic of flash memory is another reason for wide adoption in industry. However, there are some technical challenges to cope with to use the flash memory as an indispensable component of the embedded systems. These would be relatively slow cleaning time and the limited number of times to write-and-clean. In this paper, a new cleaning policy is proposed to overcome the problems mentioned above and relevant performance comparison results will be provided. Ranking cleaning policy(RCP) decides when and where to clean within the flash memory considering the cost of cleaning and the number of times of cleaning. This method will maximize not only the lifetime of flash memory but also the performance of access time and manageability. As a result of performance comparison, RCP has showed about 10 ~ 50% of performance evolution compared to traditional policies, Greedy and Cost-benefit methods, by write throughputs.