zoukankan      html  css  js  c++  java
  • Flash-aware Page Replacement Algorithm

    1.Abstract:(1)字体太乱,单词中有空格(2) FAPRA此名词第一出现时应有“ FAPRA(Flash-aware Page Replacement Algorithm)”说明。 

    2.introduction : 没有介绍目前page  replacement  algorithms  designed  for  NAND  flash memory. 

    3.Ralate Work :The least recently used algorithm (LRU) -->LRU(The least recently used algorithm ) 

    4.实验部分写的比较详细,理论阐述比较详细,数学推导比较严谨,结果展示的图表数据结果比较有说服力。 

    5.公式(1)(4)错位了

    This paper provides an efficient page replacement algorithm called FAPRA which is proposed for NAND flash memory in the light of its inherent characteristics.The algorithm is effective to  prevent  the  serious  degradation  of
    page  hit  ratio, reduce the number of write operations, as well as lower the degree of wear leveling  of NAND flash memory. Heoretical of
    the algorithm explained clearly and the experiment results to evaluate the proposed algorithms in the paper are very detailed. but , thesis writing is not very standardized,such as many separate words with spaces,the first term does not appear in the full name of the professional,in addition, I think it is better to add some introduce other current page replacement algorithms designed for NAND flash memory in the introduction.

    (1)Many separate words with spaces especially in the Abstract section

    (2)FAPRA should be written as FAPRA(Flash-aware Page Replacement Algorithm)at the first appeared time

    (3)Equation (1) and equation (4) format error

    (4)It is better to add some introduce other current page replacement algorithms designed for NAND flash memory in the introduction.

    (5) Heoretical of the algorithm explained can be more clearly

  • 相关阅读:
    布隆过滤器原理与应用场景
    【转】程序员的世界真的很难懂~
    IDEA 2019.2.4 破解安装教程
    【转】只有程序员才能看得懂的段子
    Linux 正则表达式
    【转】雷军做程序员时写的博客,很强大!
    如何同步 Linux 集群系统时间
    百度共享云盘
    Shell 脚本 test 命令详解
    Linux 命令大全
  • 原文地址:https://www.cnblogs.com/yaolei/p/3610890.html
Copyright © 2011-2022 走看看