首页> 外文会议>Design, Automation amp; Test in Europe Conference amp; Exhibition, 2009. DATE '09 >KAST: K-associative sector translation for NAND flash memory in real-time systems
【24h】

KAST: K-associative sector translation for NAND flash memory in real-time systems

机译:KAST:实时系统中NAND闪存的K关联扇区转换

获取原文

摘要

Flash memory is a good candidate for the storage device in real-time systems due to its non-fluctuating performance, low power consumption and high shock resistance. However, the garbage collection for invalid pages in flash memory can invoke a long blocking time. Moreover, the worst-case blocking time is significantly long compared to the best-case blocking time under the current flash management techniques. In this paper, we propose a novel Flash Translation Layer (FTL), called KAST, where user can configure the maximum log block associativity to control the worst-case blocking time. Performance evaluation using simulations shows that the overall performance of KAST is better than the current FTL schemes as well as KAST guarantees the longest block time is shorter than the specified value.
机译:闪存具有无波动的性能,低功耗和高抗冲击性,因此是实时系统中存储设备的理想选择。但是,闪存中无效页面的垃圾回收会导致很长的阻塞时间。此外,与当前闪存管理技术下的最佳情况下的阻止时间相比,最坏情况下的阻止时间要长得多。在本文中,我们提出了一种新颖的Flash转换层(FTL),称为KAST,用户可以在其中配置最大日志块关联性,以控制最坏情况下的阻止时间。通过仿真进行的性能评估表明,KAST的总体性能优于当前的FTL方案,并且KAST保证最长的块时间比指定的值短。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号