网格计算中的任务调度 [英] task scheduling on grid computing

问题描述

RAJA;
能否知道一种化学反应优化"算法...它可用于网格计算中的任务调度...?

谢谢您的回答

RAJA;
can any one KNOW "chemical reaction optimization" algorithm...its used for task scheduling in grid computing...?

THANKS FOR UR ANSWERS

推荐答案

网格计算通过共享资源来解决高性能和高吞吐量的计算问题，范围从
个人计算机到分布在世界各地的超级计算机.主要问题之一是任务调度，即分配
资源的任务.除了Makespan和Flowtime，我们还考虑了资源的可靠性，任务调度是
制定为具有三个目标的优化问题.这是一个NP难题，因此，元启发式方法是
用于找到最佳解决方案.本文介绍了化学反应优化(CRO)算法的几种版本
提出了针对网格调度的问题. CRO是一种基于人群的元启发式方法，其灵感来自于
中的分子之间的相互作用 化学反应.我们将这些CRO方法与其他四种公认的元启发式方法进行了广泛的实例比较.
仿真结果表明，CRO方法通常比现有方法具有更好的性能，并且性能改进

Grid computing solves high performance and high-throughput computing problems through sharing resources ranging from
personal computers to supercomputers distributed around the world. One of the major problems is task scheduling, i.e., allocating
tasks to resources. In addition to Makespan and Flowtime, we also take reliability of resources into account, and task scheduling is
formulated as an optimization problem with three objectives. This is an NP-hard problem, and thus, metaheuristic approaches are
employed to find the optimal solutions. In this paper, several versions of the Chemical Reaction Optimization (CRO) algorithm are
proposed for the grid scheduling problem. CRO is a population-based metaheuristic inspired by the interactions between molecules in
a chemical reaction. We compare these CRO methods with four other acknowledged metaheuristics on a wide range of instances.
Simulation results show that the CRO methods generally perform better than existing methods and performance improvement is
especially significant in large-scale applications.

它主要用于优化网格计算中的任务调度过程.

it is mainly used to optimized task scheduling process in grid computing..

您可以访问此网站www .ieee.com

you check out this site www.ieee.com

这篇关于网格计算中的任务调度的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！