File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

노삼혁

Noh, Sam H.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace HU -
dc.citation.conferencePlace Budapest -
dc.citation.endPage 111 -
dc.citation.startPage 106 -
dc.citation.title Proceedings of the 1997 23rd Euromicro Conference -
dc.contributor.author Lee, Donghee -
dc.contributor.author Choi, Jongmoo -
dc.contributor.author Choe, Honggi -
dc.contributor.author Noh, Sam H. -
dc.contributor.author Min, Sang Lyul -
dc.contributor.author Cho, Yookun -
dc.date.accessioned 2023-12-20T07:05:53Z -
dc.date.available 2023-12-20T07:05:53Z -
dc.date.created 2016-09-27 -
dc.date.issued 1997-09-01 -
dc.description.abstract Recently, a new block replacement policy called the LRFU (Least Recently/Frequently Used) policy was proposed that subsumes both the LRU and LFU policies, and provides a spectrum of replacement policies between them. In this paper, we describe an implementation of the LRFU replacement policy in the FreeBSD 2.1.5 and present a performance evaluation of the implementation using the SPEC SDET benchmark. The results show that the new policy gives up to a 30% performance improvement over the LRU block replacement policy. -
dc.identifier.bibliographicCitation Proceedings of the 1997 23rd Euromicro Conference, pp.106 - 111 -
dc.identifier.scopusid 2-s2.0-0031341968 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/37444 -
dc.identifier.url http://ieeexplore.ieee.org/document/658446/ -
dc.language 영어 -
dc.publisher Proceedings of the 1997 23rd Euromicro Conference -
dc.title Implementation and performance evaluation of the LRFU replacement policy -
dc.type Conference Paper -
dc.date.conferenceDate 1997-09-01 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.