首页> 外文会议>2012 IEEE Asia Pacific Conference on Circuits and Systems. >A low-complexity high-performance wear-leveling algorithm for flash memory system design
【24h】

A low-complexity high-performance wear-leveling algorithm for flash memory system design

机译:一种用于闪存系统设计的低复杂度高性能损耗均衡算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, a low-complexity high-performance wear-leveling algorithm which named sequential garbage collection (SGC) for flash memory system design is presented. The proposed SGC outperforms existing designs in terms of wear evenness and low design complexity. The lifetime of the entire flash memory can be greatly lengthened by the proposed SGC. In addition, the proposed SGC doesn't require any tuning threshold parameter, and thus it can be applied to various systems without prior knowledge of the system environment for threshold tuning. The low-complexity low-cost SGC makes it is easy to be implemented by firmware-based or hardware-based approaches. The simulation results show that the maximum block erase count and the standard deviation of the block erase count are decreased by up to 75% and 94%, respectively, as compared to the greedy algorithm.
机译:本文提出了一种用于闪存系统设计的低复杂度高性能损耗均衡算法,该算法称为顺序垃圾回收(SGC)。拟议的SGC在磨损均匀性和低设计复杂度方面优于现有设计。所提出的SGC可以大大延长整个闪存的寿命。另外,提出的SGC不需要任何调整阈值参数,因此可以将其应用于各种系统,而无需事先了解用于阈值调整的系统环境。低复杂度的低成本SGC使得可以轻松地通过基于固件或基于硬件的方法来实现。仿真结果表明,与贪婪算法相比,最大块擦除次数和块擦除次数的标准偏差分别降低了75%和94%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号