{"title":"数据网格系统中基于列表的最优副本放置策略","authors":"Yi-Fang Lin, Jan-Jan Wu, Pangfeng Liu","doi":"10.1109/ICPP.2008.31","DOIUrl":null,"url":null,"abstract":"Data replications is a typical strategy for improving access performance and data availability in data grid systems. Current works on data replication in grid systems focus on the infrastructure for data replication and the mechanism of replicas creation and deletion.The important problem of choosing suitable locations for placing replicas in data grids has not been fully studied. This paper addresses replica placement problem in data grids when given a sequence of priority lists that specify the forwarding policies for data requests. We propose the concept of priority list to address two issues. First, a user may have limited authority in accessing the resources, and thus his/her data requests should be prohibited from accessing some of the sites. Second, a static policy may not satisfy a data request with special requirements (e.g. quality of service requirement). In this priority-list-based model we propose a placement algorithm that finds optimal locations for replicas so that the workload among the replicas is balanced. We also propose an algorithm that determines the minimum number of replicas when the maximum workload capacity of each replica is given.","PeriodicalId":388408,"journal":{"name":"2008 37th International Conference on Parallel Processing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A List-Based Strategy for Optimal Replica Placement in Data Grid Systems\",\"authors\":\"Yi-Fang Lin, Jan-Jan Wu, Pangfeng Liu\",\"doi\":\"10.1109/ICPP.2008.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data replications is a typical strategy for improving access performance and data availability in data grid systems. Current works on data replication in grid systems focus on the infrastructure for data replication and the mechanism of replicas creation and deletion.The important problem of choosing suitable locations for placing replicas in data grids has not been fully studied. This paper addresses replica placement problem in data grids when given a sequence of priority lists that specify the forwarding policies for data requests. We propose the concept of priority list to address two issues. First, a user may have limited authority in accessing the resources, and thus his/her data requests should be prohibited from accessing some of the sites. Second, a static policy may not satisfy a data request with special requirements (e.g. quality of service requirement). In this priority-list-based model we propose a placement algorithm that finds optimal locations for replicas so that the workload among the replicas is balanced. We also propose an algorithm that determines the minimum number of replicas when the maximum workload capacity of each replica is given.\",\"PeriodicalId\":388408,\"journal\":{\"name\":\"2008 37th International Conference on Parallel Processing\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 37th International Conference on Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.2008.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 37th International Conference on Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.2008.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A List-Based Strategy for Optimal Replica Placement in Data Grid Systems
Data replications is a typical strategy for improving access performance and data availability in data grid systems. Current works on data replication in grid systems focus on the infrastructure for data replication and the mechanism of replicas creation and deletion.The important problem of choosing suitable locations for placing replicas in data grids has not been fully studied. This paper addresses replica placement problem in data grids when given a sequence of priority lists that specify the forwarding policies for data requests. We propose the concept of priority list to address two issues. First, a user may have limited authority in accessing the resources, and thus his/her data requests should be prohibited from accessing some of the sites. Second, a static policy may not satisfy a data request with special requirements (e.g. quality of service requirement). In this priority-list-based model we propose a placement algorithm that finds optimal locations for replicas so that the workload among the replicas is balanced. We also propose an algorithm that determines the minimum number of replicas when the maximum workload capacity of each replica is given.