Formalized methodology for data reuse exploration in hierarchical memory mappings
ISLPED '97 Proceedings of the 1997 international symposium on Low power electronics and design
Comparing System-Level Power Management Policies
IEEE Design & Test
Dynamic Power Management for Nonstationary Service Requests
IEEE Transactions on Computers
Efficient Utilization of Scratch-Pad Memory in Embedded Processor Applications
EDTC '97 Proceedings of the 1997 European conference on Design and Test
A low-cost memory architecture with NAND XIP for mobile embedded systems
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Data Reuse Analysis Technique for Software-Controlled Memory Hierarchies
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Energy-aware demand paging on NAND flash-based embedded storages
Proceedings of the 2004 international symposium on Low power electronics and design
Compiler-assisted demand paging for embedded systems with flash memory
Proceedings of the 4th ACM international conference on Embedded software
Layer Assignment echniques for Low Energy in Multi-Layered Memory Organisations
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Web-Based Energy Exploration Tool for Embedded Systems
IEEE Design & Test
Architecture exploration of NAND flash-based multimedia card
Proceedings of the conference on Design, automation and test in Europe
Application specific non-volatile primary memory for embedded systems
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Teaching page replacement algorithms with a Java-based VM simulator
Proceedings of the 14th Western Canadian Conference on Computing Education
A strategy to emulate NOR flash with NAND flash
ACM Transactions on Storage (TOS)
A file-system-aware FTL design for flash-memory storage systems
Proceedings of the Conference on Design, Automation and Test in Europe
A set-based mapping strategy for flash-memory reliability enhancement
Proceedings of the Conference on Design, Automation and Test in Europe
High durability in NAND flash memory through effective page reuse mechanisms
CODES/ISSS '10 Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
A reliable MTD design for MLC flash-memory storage systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
An adaptive file-system-oriented FTL mechanism for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
Key-Study to execute code using demand paging and NAND flash at smart card scale
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
MFTL: A Design and Implementation for MLC Flash Memory Storage Systems
ACM Transactions on Storage (TOS)
Meta-Cure: a reliability enhancement strategy for metadata in NAND flash memory storage systems
Proceedings of the 49th Annual Design Automation Conference
Write activity reduction on non-volatile main memories for embedded chip multiprocessors
ACM Transactions on Embedded Computing Systems (TECS)
ACM Transactions on Embedded Computing Systems (TECS)
Hi-index | 0.00 |
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.