{"title":"并行Pull-Based LRU:一种新的大规模SCI集群Web缓存请求分配算法","authors":"E. Cecchet, Cyril Perrin","doi":"10.1109/CLUSTER.2000.10024","DOIUrl":null,"url":null,"abstract":"The SIRAC laboratory has developed SciFS, a Distrib- uted Shared Memory (DSM) tightly integrated with the Linux operating system kernel, that exploits the high performance and remote addressing capabilities of SCI (Scalable Coherent Interface) networks. We experiment with using SciFS to build large scale clustered web caches. An efficient DSM does not only provide a fast and large data storage space, but it also allows the design of new algorithms to handle user requests. * We propose a clustered web cache prototype with a new request distribution algorithm, called PPBL (Parallel Pull-Based LRU), especially designed for use with a DSM system. Unlike other distribution algorithms the decision is distributed over all nodes thus providing better scal- ability. In this short paper, we only present PPBL princi- ples but additional information can be found on our web site at http://sci-serv.inrialpes.fr.","PeriodicalId":92128,"journal":{"name":"Proceedings. IEEE International Conference on Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel Pull-Based LRU : a New Request Distribution Algorithm for Large Scale SCI Clustered Web Caches\",\"authors\":\"E. Cecchet, Cyril Perrin\",\"doi\":\"10.1109/CLUSTER.2000.10024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The SIRAC laboratory has developed SciFS, a Distrib- uted Shared Memory (DSM) tightly integrated with the Linux operating system kernel, that exploits the high performance and remote addressing capabilities of SCI (Scalable Coherent Interface) networks. We experiment with using SciFS to build large scale clustered web caches. An efficient DSM does not only provide a fast and large data storage space, but it also allows the design of new algorithms to handle user requests. * We propose a clustered web cache prototype with a new request distribution algorithm, called PPBL (Parallel Pull-Based LRU), especially designed for use with a DSM system. Unlike other distribution algorithms the decision is distributed over all nodes thus providing better scal- ability. In this short paper, we only present PPBL princi- ples but additional information can be found on our web site at http://sci-serv.inrialpes.fr.\",\"PeriodicalId\":92128,\"journal\":{\"name\":\"Proceedings. IEEE International Conference on Cluster Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE International Conference on Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLUSTER.2000.10024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE International Conference on Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLUSTER.2000.10024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel Pull-Based LRU : a New Request Distribution Algorithm for Large Scale SCI Clustered Web Caches
The SIRAC laboratory has developed SciFS, a Distrib- uted Shared Memory (DSM) tightly integrated with the Linux operating system kernel, that exploits the high performance and remote addressing capabilities of SCI (Scalable Coherent Interface) networks. We experiment with using SciFS to build large scale clustered web caches. An efficient DSM does not only provide a fast and large data storage space, but it also allows the design of new algorithms to handle user requests. * We propose a clustered web cache prototype with a new request distribution algorithm, called PPBL (Parallel Pull-Based LRU), especially designed for use with a DSM system. Unlike other distribution algorithms the decision is distributed over all nodes thus providing better scal- ability. In this short paper, we only present PPBL princi- ples but additional information can be found on our web site at http://sci-serv.inrialpes.fr.