首页> 外文会议>High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on >Performance analysis of scheduling and replication algorithms on Grid Datafarm architecture for high-energy physics applications
【24h】

Performance analysis of scheduling and replication algorithms on Grid Datafarm architecture for high-energy physics applications

机译:用于高能物理应用的Grid Datafarm架构上的调度和复制算法的性能分析

获取原文

摘要

Data Grid is a Grid for ubiquitous access and analysis of large-scale data. Because Data Grid is in the early stages of development, the performance of its petabyte-scale models in a realistic data processing setting has not been well investigated. By enhancing our Bricks Grid simulator to accommodated Data Grid scenarios, we investigate and compare the performance of different Data Grid models. These are categorized mainly as either central or tier models; they employ various scheduling and replication strategies under realistic assumptions of job processing for CERN LHC experiments on the Grid Datafarm system. Our results show that the central model is efficient but that the tier model, with its greater resources and its speculative class of background replication policies, are quite effective and achieve higher performance, while each tier is smaller than the central model.
机译:数据网格是用于普遍访问和大规模数据分析的网格。因为数据网格处于开发的早期阶段,所以在逼真的数据处理设置中的Petabyte-Scale模型的性能并未得到很好的研究。通过增强砖电网模拟器来容纳数据网格方案,我们调查并比较不同数据网格模型的性能。这些主要作为中央或层模型分类;他们在网格数据系统上的Cern LHC实验的实际假设下雇用了各种调度和复制策略。我们的结果表明,中央模型是有效的,但是,凭借其更大的资源及其投机类的背景复制策略,具有较高的型号,具有非常有效和实现更高的性能,而每个层小于中央模型。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号