...
首页> 外文期刊>Key Engineering Materials >ARRA: an Associated Replica Replacement Algorithm Based on Apriori Approach for Data Intensive Jobs in Data Grid
【24h】

ARRA: an Associated Replica Replacement Algorithm Based on Apriori Approach for Data Intensive Jobs in Data Grid

机译:ARRA:一种基于先验方法的关联副本替换算法,用于数据网格中的数据密集型作业

获取原文
获取原文并翻译 | 示例
           

摘要

Creating many replicas in the processing of data-intensive jobs in data grid is an efficient strategy. Replica replacement is the crucial step to this strategy. Economic model, popularity model and hybrid model etc. have been proposed to solve this issue of replica replacement with analysis and prediction based on each data file, however, these models neglect association relationships among different data files. To find out these association relationships hidden in data-intensive jobs, Apriori algorithm in data mining field is adopted to analyze behaviors of each data-intensive job. An associated replica replacement algorithm based on Apriori approach in data grid is proposed in this paper. This algorithm has two major steps: 1) associated behavior analysis and classification of data files in each node; 2) generation and application of replica replacement rules. Our proposed algorithm is simulated in Optorsim to be compared with LFU algorithm. The experiment shows that there is a relative advantage compared with LFU in mean job times of all jobs, number of remote file access and effective network usage perspectives.
机译:在数据网格中处理数据密集型作业时创建许多副本是一种有效的策略。副本替换是此策略的关键步骤。已经提出了经济模型,流行度模型和混合模型等来解决基于每个数据文件进行分析和预测的副本替换问题,但是这些模型忽略了不同数据文件之间的关联关系。为了找出隐藏在数据密集型工作中的关联关系,采用数据挖掘领域的Apriori算法来分析每个数据密集型工作的行为。提出了一种基于Apriori方法的数据网格副本替换算法。该算法有两个主要步骤:1)每个节点的相关行为分析和数据文件分类; 2)复制副本替换规则的生成和应用。将我们提出的算法在Optorsim中进行仿真,以与LFU算法进行比较。实验表明,与LFU相比,在所有作业的平均作业时间,远程文件访问次数和有效的网络使用角度方面都具有相对优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号