...
首页> 外文期刊>Future generation computer systems >Optimizing execution time predictions of scientific workflow applications in the Grid through evolutionary programming
【24h】

Optimizing execution time predictions of scientific workflow applications in the Grid through evolutionary programming

机译:通过演化编程优化网格中科学工作流应用程序的执行时间预测

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

摘要

Planning for execution of scientific workflow applications in the Grid requires in advance prediction of workflow execution time for optimized execution of these applications. However, predicting execution times of such applications is very complex mainly due to different structures of workflows, possible parallel execution of workflow tasks on multiple resources and the dynamic and heterogeneous nature of the Grid. In this paper, we describe an optimized method (in extension to a previous work by Nadeem et al. (2009) [4]) for execution time prediction of workflow applications in the Grid. We characterize workflows in terms of attributes describing their structures and performance during different stages of their execution. Overall, performance of the workflows is modeled through templates of workflow attributes. An optimized method exploiting evolutionary programming is employed to search for suitable templates. Three different induction models are employed to generate predictions and later compared for their accuracy. The results from our experiments for three real-world workflow applications on a real Grid are presented to show the effectiveness of our approach. We also compare the proposed approach with our previous method based on supervised exhaustive search by Nadeem and Fahringer (2009) [4].
机译:规划网格中科学工作流程应用程序的执行需要事先预测工作流程执行时间,以优化这些应用程序的执行。但是,预测此类应用程序的执行时间非常复杂,这主要是由于工作流的结构不同,可能在多个资源上并行执行工作流任务以及网格的动态和异构性质所致。在本文中,我们描述了一种优化的方法(作为对Nadeem等人(2009)[4]先前工作的扩展),用于预测Grid中工作流应用程序的执行时间。我们通过描述工作流在执行的不同阶段的结构和性能的属性来表征工作流。总体而言,工作流的性能是通过工作流属性的模板建模的。一种采用进化编程的优化方法被用来搜索合适的模板。使用三种不同的归纳模型来生成预测,然后对其准确性进行比较。给出了我们在真实Grid上的三个真实工作流应用程序的实验结果,以证明我们方法的有效性。我们还将提出的方法与基于Nadeem和Fahringer(2009)[4]的有监督穷举搜索的先前方法进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号