<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01555558</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T06:00:38+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Taking Garbage Collection Overheads Off the Critical Path in SSDs</title>
            <author role="aut">
              <persName>
                <forename type="first">Myoungsoo</forename>
                <surname>Jung</surname>
              </persName>
              <idno type="halauthorid">1196020-0</idno>
              <affiliation ref="#struct-452398"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ramya</forename>
                <surname>Prabhakar</surname>
              </persName>
              <idno type="halauthorid">1196021-0</idno>
              <affiliation ref="#struct-452398"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mahmut</forename>
                <forename type="middle">Taylan</forename>
                <surname>Kandemir</surname>
              </persName>
              <idno type="halauthorid">1196022-0</idno>
              <affiliation ref="#struct-452398"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-07-04 11:33:07</date>
              <date type="whenModified">2025-12-24 11:40:35</date>
              <date type="whenReleased">2017-07-04 11:34:12</date>
              <date type="whenProduced">2012-12-03</date>
              <date type="whenEndEmbargoed">2015-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01555558v1/document">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01555558v1/file/978-3-642-35170-9_9_Chapter.pdf" id="file-1555558-1607981">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-01555558/file/978-3-642-35170-9_9_Chapter.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01555558</idno>
            <idno type="halUri">https://inria.hal.science/hal-01555558</idno>
            <idno type="halBibtex">jung:hal-01555558</idno>
            <idno type="halRefHtml">&lt;i&gt;13th International Middleware Conference (MIDDLEWARE)&lt;/i&gt;, Dec 2012, Montreal, QC, Canada. pp.164-186, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-35170-9_9"&gt;&amp;#x27E8;10.1007/978-3-642-35170-9_9&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">13th International Middleware Conference (MIDDLEWARE), Dec 2012, Montreal, QC, Canada. pp.164-186, &amp;#x27E8;10.1007/978-3-642-35170-9_9&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1555558-1607981"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IRISA-D7">GESTION DES DONNÉES ET DE LA CONNAISSANCE </idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="IFIP-WG6-1" corresp="IFIP-WG">Architectures and Protocols for Distributed Systems</idno>
            <idno type="stamp" n="IFIP-MIDDLEWARE">International Middleware Conference</idno>
            <idno type="stamp" n="IFIP-LNCS-7662" corresp="IFIP-LNCS">Middleware 2012</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 3: Architecture and Performance</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Taking Garbage Collection Overheads Off the Critical Path in SSDs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Myoungsoo</forename>
                    <surname>Jung</surname>
                  </persName>
                  <idno type="halauthorid">1196020-0</idno>
                  <affiliation ref="#struct-452398"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ramya</forename>
                    <surname>Prabhakar</surname>
                  </persName>
                  <idno type="halauthorid">1196021-0</idno>
                  <affiliation ref="#struct-452398"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mahmut</forename>
                    <forename type="middle">Taylan</forename>
                    <surname>Kandemir</surname>
                  </persName>
                  <idno type="halauthorid">1196022-0</idno>
                  <affiliation ref="#struct-452398"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>13th International Middleware Conference (MIDDLEWARE)</title>
                  <date type="start">2012-12-03</date>
                  <date type="end">2012-12-07</date>
                  <settlement>Montreal,                        QC</settlement>
                  <country key="CA">Canada</country>
                </meeting>
                <editor>Priya Narasimhan</editor>
                <editor>Peter Triantafillou</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Middleware 2012</biblScope>
                  <biblScope unit="volume">LNCS-7662</biblScope>
                  <biblScope unit="pp">164-186</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-35170-9_9</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Solid state disks (SSDs) have the potential to revolutionize the storage system landscape, mostly due to their good random access performance, compared to hard disks. However, garbage collection (GC) in SSD introduces significant latencies and large performance variations, which renders widespread adoption of SSDs difficult. To address this issue, we present a novel garbage collection strategy, consisting of two components, called Advanced Garbage Collection (AGC) and Delayed Garbage Collection (DGC), that operate collectively to migrate GC operations from busy periods to idle periods. More specifically, AGC is employed to defer GC operations to idle periods in advance, based on the type of the idle periods and on-demand GC needs, whereas DGC complements AGC by handling the collections that could not be handled by AGC. Our comprehensive experimental analysis reveals that the proposed strategies provide stable SSD performance by significantly reducing GC overheads. Compared to the state-of-the-art GC strategies, P-FTL, L-FTL and H-FTL, our AGC+DGC scheme reduces GC overheads, on average, by about 66.7%, 96.7% and 98.2%, respectively.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
              <org type="consortium">WG 6.1</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-452398" status="VALID">
          <idno type="ISNI">0000 0004 5907 5867</idno>
          <idno type="ROR">https://ror.org/04p491231</idno>
          <orgName>Pennsylvania State University [State College, PA]</orgName>
          <orgName type="acronym">Penn State</orgName>
          <desc>
            <address>
              <addrLine>201 Old Main, University Park, Pennsylvania 16802</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.psu.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-567057" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-567057" status="VALID">
          <orgName>Penn State System</orgName>
          <desc>
            <address>
              <addrLine>Pennsylvania, PA, USA, Etats-Unis</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://www.psu.edu/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>