TY - GEN
T1 - Demand paging for OneNAND™ Flash eXecute-in-place
AU - Joo, Yongsoo
AU - Choi, Yongseok
AU - Park, Chanik
AU - Chung, Sung Woo
AU - Chung, Eui Young
AU - Chang, Naehyuck
PY - 2006
Y1 - 2006
N2 - 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-In-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.
AB - 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-In-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.
UR - http://www.scopus.com/inward/record.url?scp=34547144263&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547144263&partnerID=8YFLogxK
U2 - 10.1145/1176254.1176310
DO - 10.1145/1176254.1176310
M3 - Conference contribution
AN - SCOPUS:34547144263
SN - 1595933700
SN - 9781595933706
T3 - CODES+ISSS 2006: Proceedings of the 4th International Conference on Hardware Software Codesign and System Synthesis
SP - 229
EP - 234
BT - CODES+ISSS 2006
T2 - CODES+ISSS 2006: 4th International Conference on Hardware Software Codesign and System Synthesis
Y2 - 22 October 2006 through 25 October 2006
ER -
