mRT-PLRU: A General Framework for Real-Time Multitask Executions on NAND Flash Memory
- Authors
- Lee, Duhee; Kim, Jong-Chan; Lee, Chang-Gun; Kim, Kanghee
- Issue Date
- Apr-2013
- Publisher
- IEEE COMPUTER SOC
- Keywords
- Soft real-time programs; NAND flash memory; multitasking; paging; mRT-PLRU
- Citation
- IEEE TRANSACTIONS ON COMPUTERS, v.62, no.4, pp.758 - 771
- Journal Title
- IEEE TRANSACTIONS ON COMPUTERS
- Volume
- 62
- Number
- 4
- Start Page
- 758
- End Page
- 771
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/11296
- DOI
- 10.1109/TC.2012.33
- ISSN
- 0018-9340
- Abstract
- This paper proposes a novel technique called mRT-PLRU (Multitasking Real-Time constrained combination of Pinning and LRU), which forms a generic framework to use inexpensive nonvolatile NAND flash memory for storing and executing real-time programs in multitasking environments. In order to execute multiple real-time tasks stored in NAND flash memory with the minimal usage of expensive RAM, the mRT-PLRU is optimally configured in two steps. In the first step, the per-task analysis finds the function of RAM size versus execution time (and the corresponding optimal pinning/LRU combination) for each individual task. Using these functions for all the tasks as inputs, the second-step called a stochastic-analysis-in-loop optimization conducts an iterative convex optimization with the stochastic analysis for the probabilistic schedulability check. As a result, the optimization loop can optimally determine the RAM sizes for multiple tasks such that their deadlines are probabilistically guaranteed with the minimal size of total RAM. The usefulness of the developed technique is intensively verified through both simulation and actual implementation. Our experimental study shows that mRT-PLRU can save up to 80 percent of RAM required by the industry-common shadowing approach.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > Department of Smart Systems Software > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.