• Login
    View Item 
    •   Shocker Open Access Repository Home
    • Engineering
    • Electrical Engineering and Computer Science
    • EECS Faculty Scholarship
    • Ravi Pendse
    • Conference proceedings
    • View Item
    •   Shocker Open Access Repository Home
    • Engineering
    • Electrical Engineering and Computer Science
    • EECS Faculty Scholarship
    • Ravi Pendse
    • Conference proceedings
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Timing analysis of block replacement algorithms on disk caches

    View/Open
    Pendse_2000a (369.0Kb)
    Date
    2000
    Author
    Rajamoni, R.
    Bhagavathula, Ravi
    Pendse, Ravi
    Metadata
    Show full item record
    Citation
    Rajamoni, R.; Bhagavathula, R.; Pendse, R.; , "Timing analysis of block replacement algorithms on disk caches," Circuits and Systems, 2000. Proceedings of the 43rd IEEE Midwest Symposium on , vol.1, no., pp.408-411 vol.1, 2000 doi: 10.1109/MWSCAS.2000.951670
    Abstract
    Cache memories are used to reduce the memory latency in systems. While instruction references of a CPU exhibit high temporal and spatial locality, disk references exhibit very minimal temporal and spatial locality. Owing to the fact that most of the block replacement algorithms exploit the available locality to improve cache performance, they are more effective with CPU instruction caches than with disk caches. This paper presents the results of an investigation of cache write policies and the impact of the Least Recently Used (LRU) and the Segmented LRU (SLRU) block replacement algorithms on the performance of disk caches. To obtain optimal performance at all workloads and cache sizes, an adaptive write caching policy is introduced. The adaptive write caching policy does a dynamic selection of the write policy at run time. Simulations reveal that when the cache size is less than 2 MB, caches employing adaptive write caching policy are 17% faster over caches employing write-back policy. For cache sizes of 16 MB and above the performance improvement is 9%. The performance improvement of caches employing adaptive write caching policy over caches employing write-through policy is 2.65% for cache sizes of 2 MB and is 27%, for cache sizes of 16 MB and above. The adaptive write caching policy yields optimum performance for many of the disk workloads and disk cache sizes
    Description
    The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xplore database licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1045954
    URI
    http://hdl.handle.net/10057/3802
    http://dx.doi.org/10.1109/MWSCAS.2000.951670
    Collections
    • Conference proceedings
    • EECS Research Publications

    Browse

    All of Shocker Open Access RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Type

    My Account

    LoginRegister

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    DSpace software copyright © 2002-2021  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV