2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer
The development of flash memory drives flash based SSDs to enter into enterprise-scale storage systems. As the kernel of SSD, flash translation layer (FTL) attracts many attentions. Generally, there are two types of FTLs according to the granularity of address mapping: block-level and page-level map...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 592 |
---|---|
container_issue | |
container_start_page | 585 |
container_title | |
container_volume | |
creator | Zhiguang Chen Nong Xiao Fang Liu Yimo Du |
description | The development of flash memory drives flash based SSDs to enter into enterprise-scale storage systems. As the kernel of SSD, flash translation layer (FTL) attracts many attentions. Generally, there are two types of FTLs according to the granularity of address mapping: block-level and page-level mapping FTLs. We focus on the latter one. Typically, page-level mapping scheme must employ a cache to alleviate the memory pressure introduced by the big mapping table. We argue that classic cache replacement policies aren't competent for the page table cache of FTLs. The major contribution of this work is to design a dedicated cache replacement policy called Two Filters (abbreviated as 2F) for page-level mapping FTLs. 2F aims at two goals. The first is higher hit ratio as all the replacement policies pursue. As 2F not only protects frequently accessed pages, but also protects sequentially accessed pages at little cost, it does achieve a higher hit ratio. The second goal is to distinguish hot pages from the cold. This goal is special for page table of FTLs. If hot and cold pages are directed to separate blocks, garbage collection will be more efficient. In order to achieve this goal, 2F employs two filters. One is used for containing sequentially accessed pages. Another is used for selecting hot pages. Trace driven simulations present that 2F outperforms classic replacement policies in both hit ratio and data classification. |
doi_str_mv | 10.1109/ICPADS.2010.60 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5695651</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5695651</ieee_id><sourcerecordid>5695651</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-6dc4784c1054a687c16a0cdc550dd9140c8af8bf4cd7207da3649a00df923d0e3</originalsourceid><addsrcrecordid>eNotkMtOg0AUQMdXIq3dunEzP0C9M8yD646gaCPGJmXf3M4MLQaBQGPSv7eJrk5yFmdxGLsXsBQC8HGVr7PnzVLCWRi4YAu0KViDWiVg8ZJF0iDEGo2-YjOhpFJopZXXLBJaihgB7S2bTdMXgIREQ8TeZfHEM74Zgmuo5Tm5Q-B1P_IPGoam2_OKdm3gfc3XtA9xGX5Cy4uWpgOvRuqmlo5N3_GSTmG8Yzc1tVNY_HPOquKlyt_i8vN1lWdl3CAcY-OdsqlyArQik1onDIHzTmvwHoUCl1Kd7mrlvJVgPSVGIQH4GmXiISRz9vCXbUII22Fsvmk8bfX5gtEi-QXLKU68</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhiguang Chen ; Nong Xiao ; Fang Liu ; Yimo Du</creator><creatorcontrib>Zhiguang Chen ; Nong Xiao ; Fang Liu ; Yimo Du</creatorcontrib><description>The development of flash memory drives flash based SSDs to enter into enterprise-scale storage systems. As the kernel of SSD, flash translation layer (FTL) attracts many attentions. Generally, there are two types of FTLs according to the granularity of address mapping: block-level and page-level mapping FTLs. We focus on the latter one. Typically, page-level mapping scheme must employ a cache to alleviate the memory pressure introduced by the big mapping table. We argue that classic cache replacement policies aren't competent for the page table cache of FTLs. The major contribution of this work is to design a dedicated cache replacement policy called Two Filters (abbreviated as 2F) for page-level mapping FTLs. 2F aims at two goals. The first is higher hit ratio as all the replacement policies pursue. As 2F not only protects frequently accessed pages, but also protects sequentially accessed pages at little cost, it does achieve a higher hit ratio. The second goal is to distinguish hot pages from the cold. This goal is special for page table of FTLs. If hot and cold pages are directed to separate blocks, garbage collection will be more efficient. In order to achieve this goal, 2F employs two filters. One is used for containing sequentially accessed pages. Another is used for selecting hot pages. Trace driven simulations present that 2F outperforms classic replacement policies in both hit ratio and data classification.</description><identifier>ISSN: 1521-9097</identifier><identifier>ISBN: 1424497272</identifier><identifier>ISBN: 9781424497270</identifier><identifier>EISSN: 2690-5965</identifier><identifier>EISBN: 9780769543079</identifier><identifier>EISBN: 0769543073</identifier><identifier>DOI: 10.1109/ICPADS.2010.60</identifier><language>eng</language><publisher>IEEE</publisher><subject>cache ; Containers ; flash ; Flash memory ; FTL ; Hard disks ; Indexes ; Information filters ; Kernel ; page-level mapping ; Prefetching ; SSD</subject><ispartof>2010 IEEE 16th International Conference on Parallel and Distributed Systems, 2010, p.585-592</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5695651$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5695651$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhiguang Chen</creatorcontrib><creatorcontrib>Nong Xiao</creatorcontrib><creatorcontrib>Fang Liu</creatorcontrib><creatorcontrib>Yimo Du</creatorcontrib><title>2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer</title><title>2010 IEEE 16th International Conference on Parallel and Distributed Systems</title><addtitle>icpads</addtitle><description>The development of flash memory drives flash based SSDs to enter into enterprise-scale storage systems. As the kernel of SSD, flash translation layer (FTL) attracts many attentions. Generally, there are two types of FTLs according to the granularity of address mapping: block-level and page-level mapping FTLs. We focus on the latter one. Typically, page-level mapping scheme must employ a cache to alleviate the memory pressure introduced by the big mapping table. We argue that classic cache replacement policies aren't competent for the page table cache of FTLs. The major contribution of this work is to design a dedicated cache replacement policy called Two Filters (abbreviated as 2F) for page-level mapping FTLs. 2F aims at two goals. The first is higher hit ratio as all the replacement policies pursue. As 2F not only protects frequently accessed pages, but also protects sequentially accessed pages at little cost, it does achieve a higher hit ratio. The second goal is to distinguish hot pages from the cold. This goal is special for page table of FTLs. If hot and cold pages are directed to separate blocks, garbage collection will be more efficient. In order to achieve this goal, 2F employs two filters. One is used for containing sequentially accessed pages. Another is used for selecting hot pages. Trace driven simulations present that 2F outperforms classic replacement policies in both hit ratio and data classification.</description><subject>cache</subject><subject>Containers</subject><subject>flash</subject><subject>Flash memory</subject><subject>FTL</subject><subject>Hard disks</subject><subject>Indexes</subject><subject>Information filters</subject><subject>Kernel</subject><subject>page-level mapping</subject><subject>Prefetching</subject><subject>SSD</subject><issn>1521-9097</issn><issn>2690-5965</issn><isbn>1424497272</isbn><isbn>9781424497270</isbn><isbn>9780769543079</isbn><isbn>0769543073</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkMtOg0AUQMdXIq3dunEzP0C9M8yD646gaCPGJmXf3M4MLQaBQGPSv7eJrk5yFmdxGLsXsBQC8HGVr7PnzVLCWRi4YAu0KViDWiVg8ZJF0iDEGo2-YjOhpFJopZXXLBJaihgB7S2bTdMXgIREQ8TeZfHEM74Zgmuo5Tm5Q-B1P_IPGoam2_OKdm3gfc3XtA9xGX5Cy4uWpgOvRuqmlo5N3_GSTmG8Yzc1tVNY_HPOquKlyt_i8vN1lWdl3CAcY-OdsqlyArQik1onDIHzTmvwHoUCl1Kd7mrlvJVgPSVGIQH4GmXiISRz9vCXbUII22Fsvmk8bfX5gtEi-QXLKU68</recordid><startdate>201012</startdate><enddate>201012</enddate><creator>Zhiguang Chen</creator><creator>Nong Xiao</creator><creator>Fang Liu</creator><creator>Yimo Du</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201012</creationdate><title>2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer</title><author>Zhiguang Chen ; Nong Xiao ; Fang Liu ; Yimo Du</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-6dc4784c1054a687c16a0cdc550dd9140c8af8bf4cd7207da3649a00df923d0e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>cache</topic><topic>Containers</topic><topic>flash</topic><topic>Flash memory</topic><topic>FTL</topic><topic>Hard disks</topic><topic>Indexes</topic><topic>Information filters</topic><topic>Kernel</topic><topic>page-level mapping</topic><topic>Prefetching</topic><topic>SSD</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhiguang Chen</creatorcontrib><creatorcontrib>Nong Xiao</creatorcontrib><creatorcontrib>Fang Liu</creatorcontrib><creatorcontrib>Yimo Du</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhiguang Chen</au><au>Nong Xiao</au><au>Fang Liu</au><au>Yimo Du</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer</atitle><btitle>2010 IEEE 16th International Conference on Parallel and Distributed Systems</btitle><stitle>icpads</stitle><date>2010-12</date><risdate>2010</risdate><spage>585</spage><epage>592</epage><pages>585-592</pages><issn>1521-9097</issn><eissn>2690-5965</eissn><isbn>1424497272</isbn><isbn>9781424497270</isbn><eisbn>9780769543079</eisbn><eisbn>0769543073</eisbn><abstract>The development of flash memory drives flash based SSDs to enter into enterprise-scale storage systems. As the kernel of SSD, flash translation layer (FTL) attracts many attentions. Generally, there are two types of FTLs according to the granularity of address mapping: block-level and page-level mapping FTLs. We focus on the latter one. Typically, page-level mapping scheme must employ a cache to alleviate the memory pressure introduced by the big mapping table. We argue that classic cache replacement policies aren't competent for the page table cache of FTLs. The major contribution of this work is to design a dedicated cache replacement policy called Two Filters (abbreviated as 2F) for page-level mapping FTLs. 2F aims at two goals. The first is higher hit ratio as all the replacement policies pursue. As 2F not only protects frequently accessed pages, but also protects sequentially accessed pages at little cost, it does achieve a higher hit ratio. The second goal is to distinguish hot pages from the cold. This goal is special for page table of FTLs. If hot and cold pages are directed to separate blocks, garbage collection will be more efficient. In order to achieve this goal, 2F employs two filters. One is used for containing sequentially accessed pages. Another is used for selecting hot pages. Trace driven simulations present that 2F outperforms classic replacement policies in both hit ratio and data classification.</abstract><pub>IEEE</pub><doi>10.1109/ICPADS.2010.60</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1521-9097 |
ispartof | 2010 IEEE 16th International Conference on Parallel and Distributed Systems, 2010, p.585-592 |
issn | 1521-9097 2690-5965 |
language | eng |
recordid | cdi_ieee_primary_5695651 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | cache Containers flash Flash memory FTL Hard disks Indexes Information filters Kernel page-level mapping Prefetching SSD |
title | 2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T08%3A43%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=2F:%20A%20Special%20Cache%20for%20Mapping%20Table%20of%20Page-Level%20Flash%20Translation%20Layer&rft.btitle=2010%20IEEE%2016th%20International%20Conference%20on%20Parallel%20and%20Distributed%20Systems&rft.au=Zhiguang%20Chen&rft.date=2010-12&rft.spage=585&rft.epage=592&rft.pages=585-592&rft.issn=1521-9097&rft.eissn=2690-5965&rft.isbn=1424497272&rft.isbn_list=9781424497270&rft_id=info:doi/10.1109/ICPADS.2010.60&rft_dat=%3Cieee_6IE%3E5695651%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769543079&rft.eisbn_list=0769543073&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5695651&rfr_iscdi=true |