• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > Çѱ¹Á¤º¸°úÇÐȸ Çмú´ëȸ > 2017³â ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ

2017³â ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ

Current Result Document : 1 / 1

ÇѱÛÁ¦¸ñ(Korean Title) Reliability for Real-Time Multitask Executions on NAND Flash Memory
¿µ¹®Á¦¸ñ(English Title) Reliability for Real-Time Multitask Executions on NAND Flash Memory
ÀúÀÚ(Author) Gadimli Nushaba Chang-Gun Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 44 NO. 01 PP. 1483 ~ 1484 (2017. 06)
Çѱ۳»¿ë
(Korean Abstract)
NAND flash memory has been widely used as a nonvolatile storage for storing data. However, it is challenging to execute program codes on NAND flash memory, it can only support page-based reads, not byte-level random reads. In this paper, will present an idea of how to guarantee reliability on 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 minimal usage of expensive RAM, the mRT-PLRU is optimally configured in two steps. As a result, its optimally determine the RAM sizes for multiple tasks such that their deadlines are probabilistically guaranteed with the minimal size of total RAM. But going through on this technique, it¡¯s also exhibits reliability issues while executing real-time programs on NAND flash memory such as read disturb errors. Under this kind real-time system circumstance, to the best of our knowledge, this is the first effort of our studies on reliability of NAND flash memory we will propose possible solution method to guarantee reliability of NAND flash memory for probabilistic schedulability check.
¿µ¹®³»¿ë
(English Abstract)
NAND flash memory has been widely used as a nonvolatile storage for storing data. However, it is challenging to execute program codes on NAND flash memory, it can only support page-based reads, not byte-level random reads. In this paper, will present an idea of how to guarantee reliability on 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 minimal usage of expensive RAM, the mRT-PLRU is optimally configured in two steps. As a result, its optimally determine the RAM sizes for multiple tasks such that their deadlines are probabilistically guaranteed with the minimal size of total RAM. But going through on this technique, it¡¯s also exhibits reliability issues while executing real-time programs on NAND flash memory such as read disturb errors. Under this kind real-time system circumstance, to the best of our knowledge, this is the first effort of our studies on reliability of NAND flash memory we will propose possible solution method to guarantee reliability of NAND flash memory for probabilistic schedulability check.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå