본문 바로가기
  • Home

Worst Case Response Time Analysis for Demand Paging on Flash Memory

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2006, 11(6), pp.113-124
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

이영호 1 Sung-Soo Lim 1

1국민대학교

Candidate

ABSTRACT

Flash memory has been increasingly used in handheld devices not only for data storage, but also for code storage. Because NAND flash memory only provides sequential access feature, a traditionally accepted solution to execute the program from NAND flash memory is shadowing. But, shadowing has significant drawbacks: increasing a booting time of the system and consuming severe DRAM space. Demand paging has obtained significant attention for program execution from NAND flash memory. But, one of the issues is that there has been no effort to bound demand paging cost in flash memory and to analyze the worst case performance of demand paging. For the worst case timing analysis of programs running from NAND flash memory, the worst case demand paging costs should be estimated. In this paper, we propose two different WCRT analysis methods considering demand paging costs, DP-Pessimistic and DP-Accurate, depending on the accuracy and the complexity of analysis. Also, we compare the accuracy between DP-Pessimistic and DP-Accurate by using the simulation.

Citation status

* References for papers published after 2022 are currently being built.