实时数据网格中高优先级任务的多级数据复制分布式决策策略

Naghmeh Esmaily, M. Jafari, Mehran Mohsen Zadeh
{"title":"实时数据网格中高优先级任务的多级数据复制分布式决策策略","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":"{\"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}","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

摘要

实时数据网格是某些类型的数据网格,其中的作业应在确定的时间段内完成。如果设置的时间过长,则程序可能无法在指定的时间内执行。数据复制问题是作为在网格中指定的截止日期内快速访问数据和执行程序的过程提出的。在数据复制中,评估复制的参数、选择要复制的文件、复制的数量和新副本的位置是应该解决的重要挑战。本文提出了一种新的数据动态复制算法——分布式数据复制(DDR),该算法通过三层复制的分布式决策来解决上述问题,满足实时数据的需求。仿真结果表明,与其他算法相比,DDR算法中作业的平均执行时间和服务器流量都有所减少,作业失败的情况也有所减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Presentation of Multi Level Data Replication Distributed Decision Making Strategy for High Priority Tasks in Real Time Data Grids
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信