首页> 外文会议>IEEE Conference on Local Computer Networks >A Multi-Objective Optimization Model for Data-Intensive Workflow Scheduling in Data Grids
【24h】

A Multi-Objective Optimization Model for Data-Intensive Workflow Scheduling in Data Grids

机译:数据网格中数据密集型工作流调度的多目标优化模型

获取原文

摘要

The concept of workflow is used for modeling many of the data-intensive scientific applications executed on data grids. A Workflow is a series of interdependent tasks during which data is processed by different tasks. Scheduling the workflows in the grids is the process of assigning tasks to appropriate resources with the aim of achieving goals such as reducing workflow completion time while considering the data dependencies between the tasks. Data access time, processing time, and waiting time together constitute task completion time in the grids. Workflow scheduling aims to optimize these parameters in such a way that the workflow completion time decreases, and the system efficiency improves. In this paper, a scheduling model based on multi-objective optimization is proposed for scheduling data-intensive workflows in data grids. The scheduling model aims to optimize data communication cost, waiting time, and tasks processing time while considering data dependencies between the tasks. The model defines the data communication cost in terms of data transfer time in various communications between nodes (intra-and inter-cluster communications). This study uses four different Multi-Objective Evolutionary Algorithms (MOEAs) as well as Random Search (RS) algorithm to implement the proposed scheduling model. Convenient coding mechanisms for representing chromosomes, compatible crossover and mutation operators were also designed. Simulation results of the proposed scheduling model using different optimization algorithms are presented. The results are then assessed and compared based on different quality indicators.
机译:工作流的概念用于对在数据网格上执行的许多数据密集型科学应用程序进行建模。工作流是一系列相互依赖的任务,在此过程中,数据由不同的任务处理。在网格中安排工作流是将任务分配给适当资源的过程,目的是实现一些目标,例如减少工作流完成时间,同时考虑到任务之间的数据依赖性。数据访问时间,处理时间和等待时间共同构成了网格中的任务完成时间。工作流计划旨在以减少工作流完成时间并提高系统效率的方式优化这些参数。本文提出了一种基于多目标优化的调度模型,用于在数据网格中调度数据密集型工作流。调度模型旨在优化数据通信成本,等待时间和任务处理时间,同时考虑任务之间的数据依赖性。该模型根据节点之间的各种通信(集群内和集群间通信)中的数据传输时间来定义数据通信成本。本研究使用四种不同的多目标进化算法(MOEA)以及随机搜索(RS)算法来实现所提出的调度模型。还设计了用于表示染色体,兼容的交叉和突变算子的便捷编码机制。给出了采用不同优化算法的调度模型的仿真结果。然后根据不同的质量指标对结果进行评估和比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号