{"title":"A Server Cache Size Aware Cache Replacement Algorithm for Block Level Network Storage","authors":"Yusuke Nagasako, Saneyasu Yamaguchi","doi":"10.1109/ISADS.2011.80","DOIUrl":null,"url":null,"abstract":"Storage management cost is one of the most important issues in the current computer system. Network storage is deployed in many companies to decrease this cost. In the network storage system, both the server computer and network storage have cache memory for the same storage. In most cache implementation, LRU replacement algorithm, which is suitable for accesses with temporal locality of reference, is adopted. However, accesses to network storage do not have usual temporal locality but have negative temporal locality. Consequently, caches in network storages do not work effectively. In this paper, we propose a new cache replacement algorithm, which is suitable for negative temporal locality of reference. Our simulation evaluation demonstrated that the proposed algorithm provides better cache hit ratio than other existing algorithms.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Tenth International Symposium on Autonomous Decentralized Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2011.80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
Storage management cost is one of the most important issues in the current computer system. Network storage is deployed in many companies to decrease this cost. In the network storage system, both the server computer and network storage have cache memory for the same storage. In most cache implementation, LRU replacement algorithm, which is suitable for accesses with temporal locality of reference, is adopted. However, accesses to network storage do not have usual temporal locality but have negative temporal locality. Consequently, caches in network storages do not work effectively. In this paper, we propose a new cache replacement algorithm, which is suitable for negative temporal locality of reference. Our simulation evaluation demonstrated that the proposed algorithm provides better cache hit ratio than other existing algorithms.