{"corpus_id":32395294,"paper_sha":"aa74c5bd1e748489c0f7466750e1052b21d1ad37","doi":"10.1109/ACCESS.2017.2740327","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":2746457839,"dblp_id":"journals/access/HeJHWY17","acl_id":null,"title":"Locality-Aware Replacement Algorithm in Flash Memory to Optimize Cloud Computing for Smart Factory of Industry 4.0","year":2017,"publication_date":"2017-08-21","venue":"IEEE Access","journal":{"name":"IEEE Access","pages":"16252-16262","volume":"5"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Computer Science","Engineering"],"reference_count":23,"citation_count":21,"influential_citation_count":2,"is_open_access":false,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":null,"s2_open_access_landing_url":null,"s2_open_access_license":null,"s2_open_access_status":null,"pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"Cloud computing platform is one of the most important parts in the smart factory of industry 4.0. Currently, most cloud computing platforms have adopted flash memory as the mainly storage for more efficiency, because the flash memory having high capacity and speed. However, flash memory exhibits certain drawbacks in terms of out-of-place updates and asymmetric I/O latencies for read, write, and erase operations. These disadvantages prevent replacing traditional disks. Fortunately, the flash buffer can be used to address these drawbacks, and its replacement policies provide efficiency methods. Therefore, in this paper, we propose a locality-aware least recently used (LLRU) replacement algorithm, which exploits both access and locality characteristics. LLRU divides the LRU list into four lists: the hot-clean, hot-dirty, cold-clean, and cold-dirty LRU lists. According to reuse probability and eviction cost, the eviction page is selected to ensure effective system performance for cloud computing. The experimental results demonstrate LLRU outperforms other algorithms, including LRU, CF-LRU, LRU-WSR, and AD-LRU, which can optimize cloud computing for smart factory of industry 4.0.","claims":[{"public_id":"cl_65c01b3b94a3f8fd75712e3f93e6c8b3","status":"active","text":"Experimental results demonstrate LLRU outperforms LRU, CF-LRU, LRU-WSR, and AD-LRU in optimizing cloud computing for smart factory of Industry 4.0.","confidence":0.9,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_65c01b3b94a3f8fd75712e3f93e6c8b3"},{"public_id":"cl_78c7081d45f3da960b90d0a01f274ee0","status":"active","text":"LLRU divides the LRU list into four lists: hot-clean, hot-dirty, cold-clean, and cold-dirty LRU lists, and selects eviction pages based on reuse probability and eviction cost.","confidence":0.95,"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_78c7081d45f3da960b90d0a01f274ee0"}],"concepts":[{"public_id":"co_5f8e480065fcca0724f437fd9f9cecc1","status":"active","name":"cold-dirty","description":"One of the four LRU sublists in LLRU, containing pages that are infrequently accessed (cold) and dirty (modified).","types":["list category"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_5f8e480065fcca0724f437fd9f9cecc1"},{"public_id":"co_6150f6ae6f360e25772365d03b48598b","status":"active","name":"LRU","description":"Least recently used replacement algorithm used as a baseline for comparison in the experiments.","types":["baseline algorithm"],"aliases":["least recently used"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_6150f6ae6f360e25772365d03b48598b"},{"public_id":"co_876ca91dfc9edf9237ed4d675dd3bfdd","status":"active","name":"LLRU","description":"Locality-aware least recently used replacement algorithm proposed for flash memory buffers, which divides the LRU list into four sublists based on access and locality characteristics.","types":["algorithm"],"aliases":["locality-aware least recently used"],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_876ca91dfc9edf9237ed4d675dd3bfdd"},{"public_id":"co_8e5d384a2b0a6bb8e0b439eafaef8067","status":"active","name":"hot-dirty","description":"One of the four LRU sublists in LLRU, containing pages that are both frequently accessed (hot) and dirty (modified).","types":["list category"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_8e5d384a2b0a6bb8e0b439eafaef8067"},{"public_id":"co_9eec4c75deadb19aa7c10e3eb65e868a","status":"active","name":"cold-clean","description":"One of the four LRU sublists in LLRU, containing pages that are infrequently accessed (cold) and clean (not modified).","types":["list category"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_9eec4c75deadb19aa7c10e3eb65e868a"},{"public_id":"co_a0c5a805041c999b0f3fd9e2c79d9f55","status":"active","name":"LRU list","description":"The traditional least recently used list that LLRU divides into four separate lists for hot-clean, hot-dirty, cold-clean, and cold-dirty pages.","types":["data structure"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_a0c5a805041c999b0f3fd9e2c79d9f55"},{"public_id":"co_a4dd455b42cfedd13c6b18727e759ff2","status":"active","name":"AD-LRU","description":"A replacement algorithm compared against LLRU in the experiments.","types":["baseline algorithm"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_a4dd455b42cfedd13c6b18727e759ff2"},{"public_id":"co_d3061d5f630b5fb597586376a5f4b69a","status":"active","name":"hot-clean","description":"One of the four LRU sublists in LLRU, containing pages that are both frequently accessed (hot) and clean (not modified).","types":["list category"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_d3061d5f630b5fb597586376a5f4b69a"},{"public_id":"co_de0407737e28e4c9a0d69ad4afe98444","status":"active","name":"LRU-WSR","description":"A replacement algorithm compared against LLRU in the experiments.","types":["baseline algorithm"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_de0407737e28e4c9a0d69ad4afe98444"},{"public_id":"co_e958c3f33de19a2192061f3ed33f5b23","status":"active","name":"CF-LRU","description":"A flash-aware replacement algorithm compared against LLRU in the experiments.","types":["baseline algorithm"],"aliases":[],"contributors":[{"id":32,"public_id":"7c402c1b98","public_label":"뀨 (7c402c1b98)","roles":["extraction"],"url":"https://sah.borca.ai/u/7c402c1b98"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_e958c3f33de19a2192061f3ed33f5b23"}],"external_ids":{"DOI":"10.1109/ACCESS.2017.2740327","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":2746457839,"DBLP":"journals/access/HeJHWY17","ACL":null},"open_access":{"is_open_access":false,"pdf_url":null,"landing_url":"https://sah.borca.ai/papers/32395294","source":null,"pdf_url_source":null,"license":null,"reason":"pdf_url_not_indexed"},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":637488,"paper_uid":"9f8eb060-a168-44f6-b93e-3b0bd931b08f","canonical_identity":{"paper_id":637488,"paper_uid":"9f8eb060-a168-44f6-b93e-3b0bd931b08f","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/32395294"}