...
首页> 外文期刊>International Journal of Engineering Science and Technology >IMPROVED JOB-GROUPING BASED PSO ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING
【24h】

IMPROVED JOB-GROUPING BASED PSO ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING

机译:网格计算中基于任务组的改进PSO算法

获取原文

摘要

The goal of grid computing is to provide powerful computing abilities for complicated tasks by using all available and free computational resources. A suitable and efficient scheduling algorithm is needed to schedule user jobs to heterogeneous resources distributed in the grid. So scheduling is an important issue in a grid computing environment. In this paper an improved heuristic approach based on Particle Swarm Optimization (PSO) algorithm is presented to solve task scheduling problem in grid. In this proposed scheduling approach tasks are grouped and allocated in an Un-uniform manner. The percentage of the processing capability of a resource on the total processing capability of all the resources is calculated. Using this percentage, the processing capability of a resource based on the total length of all tasks to be scheduled is calculated. Due to job grouping this approach optimizes computation/communication ratio and the utilization of resources is also increased.
机译:网格计算的目标是通过使用所有可用和免费的计算资源,为复杂的任务提供强大的计算能力。需要一种合适且高效的调度算法来将用户作业调度到网格中分布的异构资源。因此,调度是网格计算环境中的重要问题。本文提出了一种基于粒子群优化算法的改进启发式方法,以解决网格任务调度问题。在该提出的调度方法中,任务以不均匀的方式被分组和分配。计算资源的处理能力在所有资源的总处理能力中所占的百分比。使用此百分比,将基于要调度的所有任务的总长度来计算资源的处理能力。由于工作分组,该方法优化了计算/通信比率,并且资源利用率也得到提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号