{"title":"Presentation of Multi Level Data Replication Distributed Decision Making Strategy for High Priority Tasks in Real Time Data Grids","authors":"Naghmeh Esmaily, M. Jafari, Mehran Mohsen Zadeh","doi":"10.5013/ijssst.a.12.06.05","DOIUrl":null,"url":null,"abstract":"Real time data grids are some type of data grids in which the jobs should be done within a definite time period. If this period takes a longer time, the programs will not possibly be executed within the specified time period. Data replication issue is brought up as a procedure for prompt access to data and execution of programs within the specified deadline in the grids. In data replication, the parameters under assessment for replication, selection of the file to be replicated, number of replications and the location of new copies are important challenges that should be addressed. In this paper, dynamic replication algorithm of a new data called Distributed Date Replication (DDR) is introduced that improves the mentioned challenges and meets real time data by distributed decision for replication in three levels. Simulation results showed that the average time for executing the jobs and server traffic in DDR algorithm decreased as compared to other algorithms and less jobs failed.","PeriodicalId":14286,"journal":{"name":"International journal of simulation: systems, science & technology","volume":"99 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of simulation: systems, science & technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5013/ijssst.a.12.06.05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Real time data grids are some type of data grids in which the jobs should be done within a definite time period. If this period takes a longer time, the programs will not possibly be executed within the specified time period. Data replication issue is brought up as a procedure for prompt access to data and execution of programs within the specified deadline in the grids. In data replication, the parameters under assessment for replication, selection of the file to be replicated, number of replications and the location of new copies are important challenges that should be addressed. In this paper, dynamic replication algorithm of a new data called Distributed Date Replication (DDR) is introduced that improves the mentioned challenges and meets real time data by distributed decision for replication in three levels. Simulation results showed that the average time for executing the jobs and server traffic in DDR algorithm decreased as compared to other algorithms and less jobs failed.