局域网远程缓存架构中基于lru的复制策略

[1992] Proceedings 17th Conference on Local Computer Networks Pub Date : 1992-09-13 DOI:10.1109/LCN.1992.228125

A. Leff, J. Wolf, Philip S. Yu

{"title":"局域网远程缓存架构中基于lru的复制策略","authors":"A. Leff, J. Wolf, Philip S. Yu","doi":"10.1109/LCN.1992.228125","DOIUrl":null,"url":null,"abstract":"For LAN environments, a simple modification of the LRU replacement algorithm is proposed. By limiting the number of object replicas, the algorithm can substantially improve LRU performance over a wide range of parameters. The relatively simple LAN topology implies that much less state information need be available for good replacement decisions, compared to general network topologies.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"37 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"LRU-based replication strategies in a LAN remote caching architecture\",\"authors\":\"A. Leff, J. Wolf, Philip S. Yu\",\"doi\":\"10.1109/LCN.1992.228125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For LAN environments, a simple modification of the LRU replacement algorithm is proposed. By limiting the number of object replicas, the algorithm can substantially improve LRU performance over a wide range of parameters. The relatively simple LAN topology implies that much less state information need be available for good replacement decisions, compared to general network topologies.<<ETX>>\",\"PeriodicalId\":249184,\"journal\":{\"name\":\"[1992] Proceedings 17th Conference on Local Computer Networks\",\"volume\":\"37 5\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings 17th Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1992.228125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 17th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1992.228125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

对于局域网环境，提出了对LRU替换算法的一种简单修改。通过限制对象副本的数量，该算法可以在广泛的参数范围内大幅提高LRU性能。相对简单的局域网拓扑意味着，与一般网络拓扑相比，需要更少的状态信息才能做出好的替换决策。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

LRU-based replication strategies in a LAN remote caching architecture

For LAN environments, a simple modification of the LRU replacement algorithm is proposed. By limiting the number of object replicas, the algorithm can substantially improve LRU performance over a wide range of parameters. The relatively simple LAN topology implies that much less state information need be available for good replacement decisions, compared to general network topologies.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings 17th Conference on Local Computer Networks

自引率

0.00%

发文量