• DocumentCode
    3090385
  • Title

    PBFTL: The Page to Block Mapping FTL with Low Response Time

  • Author

    Chen, Zhiguang ; Xiao, Nong ; Liu, Fang ; Du, Yimo

  • Author_Institution
    Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
  • fYear
    2011
  • fDate
    25-27 July 2011
  • Firstpage
    475
  • Lastpage
    477
  • Abstract
    NAND flash has some inherent peculiarities which increase the access delay seriously. We propose the Page to Block mapping Flash Translation Layer (PBFTL). Solid State Drives (SSDs) adopting PBFTL have lower response time. To achieve low response time for read requests, PBFTL adopts hybrid-level mapping scheme. But, hybrid-level FTL behaves awkwardly for write due to the high overhead of garbage collection. PBFTL takes two measures to optimize garbage collection. The first is to direct hot and cold data to separate blocks, which mitigates write amplification significantly. The second is to reduce the latency of reclaiming a block, which enables PBFTL to spend less time on garbage collection. User´s requests are unlikely to be congested for a long time. Trace-driven simulations show that, PBFTL achieves low response for both read- and write-intensive workloads.
  • Keywords
    NAND circuits; flash memories; NAND flash; garbage collection; page to block mapping flash translation layer; read intensive workloads; solid state drives; trace driven simulations; write intensive workloads; Analytical models; Arrays; Computational modeling; Flash memory; Recycling; Solids; Time factors; FTL; PBFTL; SSD; flash memory; page to block mapping;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Modeling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS), 2011 IEEE 19th International Symposium on
  • Conference_Location
    Singapore
  • ISSN
    1526-7539
  • Print_ISBN
    978-1-4577-0468-0
  • Type

    conf

  • DOI
    10.1109/MASCOTS.2011.31
  • Filename
    6005399