Yongsoo Joo, Yongseok Choi, Chanik Park, S. Chung, Eui-Young Chung, N. Chang
{"title":"Demand paging for OneNANDTM Flash eXecute-in-place","authors":"Yongsoo Joo, Yongseok Choi, Chanik Park, S. Chung, Eui-Young Chung, N. Chang","doi":"10.1145/1176254.1176310","DOIUrl":null,"url":null,"abstract":"NAND flash memory can provide cost-effective secondary storage in mobile embedded systems, but its lack of a random access capability means that code shadowing is generally required, taking up extra RAM space. Demand paging with NAND flash memory has recently been proposed as an alternative which requires less RAM. This scheme is even more attractive for OneNAND flash, which consists of a NAND flash array with SRAM buffers, and supports eXecute-ln-Place (XIP), which allows limited random access to data on the SRAM buffers. We introduce a novel demand paging method for OneNAND flash memory with XIP feature. The proposed on-line demand paging method with XIP adopts finite size sliding window to capture the paging history and thus predict future page demands. We particularly focus on non-critical code accesses which can disturb real-time code. Experimental results show that our method outperforms conventional LRU-based demand paging by 57% in terms of execution time and by 63% in terms of energy consumption. It even beats the optimal solution obtained from MIN, which is a conventional off-line demand paging technique by 30% and 40% respectively.","PeriodicalId":370841,"journal":{"name":"Proceedings of the 4th International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS '06)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS '06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1176254.1176310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 36
Abstract
NAND flash memory can provide cost-effective secondary storage in mobile embedded systems, but its lack of a random access capability means that code shadowing is generally required, taking up extra RAM space. Demand paging with NAND flash memory has recently been proposed as an alternative which requires less RAM. This scheme is even more attractive for OneNAND flash, which consists of a NAND flash array with SRAM buffers, and supports eXecute-ln-Place (XIP), which allows limited random access to data on the SRAM buffers. We introduce a novel demand paging method for OneNAND flash memory with XIP feature. The proposed on-line demand paging method with XIP adopts finite size sliding window to capture the paging history and thus predict future page demands. We particularly focus on non-critical code accesses which can disturb real-time code. Experimental results show that our method outperforms conventional LRU-based demand paging by 57% in terms of execution time and by 63% in terms of energy consumption. It even beats the optimal solution obtained from MIN, which is a conventional off-line demand paging technique by 30% and 40% respectively.
NAND闪存可以在移动嵌入式系统中提供具有成本效益的辅助存储,但它缺乏随机访问能力,这意味着通常需要代码阴影,占用额外的RAM空间。NAND闪存的需求分页最近被提议作为一种需要更少RAM的替代方案。该方案对OneNAND闪存更具吸引力,OneNAND闪存由带有SRAM缓冲区的NAND闪存阵列组成,并支持execute - len - place (XIP),这允许对SRAM缓冲区上的数据进行有限的随机访问。介绍了一种基于XIP特性的OneNAND闪存的需求分页方法。提出的基于XIP的在线需求分页方法采用有限大小的滑动窗口捕获分页历史,从而预测未来的页面需求。我们特别关注可能干扰实时代码的非关键代码访问。实验结果表明,我们的方法在执行时间上比传统的基于lru的需求分页方法高出57%,在能耗方面高出63%。它甚至比MIN获得的最优解决方案分别高出30%和40%,MIN是一种传统的离线需求分页技术。