Journal article Open Access

Garbage Collection Algorithms in Flash-Based Solid State Drives

Rishabh Gogna


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Flash Memory, Garbage Collection, Solid State Drive, Write Amplification.</subfield>
  </datafield>
  <controlfield tag="005">20220112134849.0</controlfield>
  <controlfield tag="001">5839608</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Publisher</subfield>
    <subfield code="4">spn</subfield>
    <subfield code="a">Blue Eyes Intelligence Engineering  and Sciences Publication(BEIESP)</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">384276</subfield>
    <subfield code="z">md5:8ad8a108363369a9a089de36841fee2d</subfield>
    <subfield code="u">https://zenodo.org/record/5839608/files/K78190991120.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2020-10-30</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o">oai:zenodo.org:5839608</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="c">29-33</subfield>
    <subfield code="n">12</subfield>
    <subfield code="p">International Journal of Innovative Technology and Exploring Engineering (IJITEE)</subfield>
    <subfield code="v">9</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Department of Electronics and Communication  Engineering, Amity University Mumbai</subfield>
    <subfield code="a">Rishabh Gogna</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Garbage Collection Algorithms in Flash-Based  Solid State Drives</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">ISSN</subfield>
    <subfield code="0">(issn)2278-3075</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2=" ">
    <subfield code="a">Retrieval Number</subfield>
    <subfield code="0">(handle)100.1/ijitee.K78190991120</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Solid state drives (SSDs)have emerged as faster and more reliable data storages over the last few years. Their intrinsic characteristics prove them to be more efficient as compared to other traditional storage media such as the Hard Disk Drives (HDDs). Issues such as write amplification, however, degrade the performance and lifespan of an SSD. This issue is in turn handled by the Garbage Collection (GC) algorithms that are put in place to supply free blocks for serving the writes being made to the flash-based SSDs and thus reduce the need of extra unnecessary writes. The LRU/FIFO, Greedy, Windowed Greedy and D choices algorithms have been described to lower write amplification for incoming writes which are different in nature. The performance of the GC algorithms varies based on factors such as pre-defined hot/cold data separation, hotness of data, uniform/non-uniform nature of incoming writes, the GC window size and the number of pages in each block of the flash memory package. Finally, it can be seen that the number of write frontiers so used, can dictate the separation of hot/cold data and increase the performance of a GC algorithm.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">issn</subfield>
    <subfield code="i">isCitedBy</subfield>
    <subfield code="a">2278-3075</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.35940/ijitee.K7819.1091220</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
</record>
35
14
views
downloads
Views 35
Downloads 14
Data volume 5.4 MB
Unique views 29
Unique downloads 14

Share

Cite as