Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems
Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems
复制标题
DOI：
10.1109/hcw.1999.765094
复制
发表时间：
1999-04
期刊：
影响因子：
--
通讯作者：
Muthucumaru Maheswaran;Shoukat Ali;H. Siegel;D. Hensgen;R. F. Freund
中科院分区：
文献类型：
--
作者：
Muthucumaru Maheswaran;Shoukat Ali;H. Siegel;D. Hensgen;R. F. Freund
研究了一类使用异构型分布式计算系统的独立任务的动态映射(匹配和调度)启发式算法。考虑了两种类型的映射启发式：在线启发式和批处理模式启发式。作为研究的一部分，介绍了三种新的启发式算法，一种用于批量生产，两种用于在线生产。进行了仿真研究，将这些启发式算法与现有的一些启发式算法进行了比较。总共检查了5个在线启发式算法和3个批次启发式算法。在线启发式算法以不同的程度和不同的方式考虑不同机器和机器就绪时间的任务亲和力。批处理启发式算法考虑了这些因素，以及等待执行的任务的老化。仿真结果表明，映射启发式的选择取决于以下参数：(A)任务和机器之间的异构性结构；(B)优化要求；(C)任务的到达率。
Dynamic mapping (matching and scheduling) heuristics for a class of independent tasks using heterogeneous distributed computing systems are studied. Two types of mapping heuristics are considered: on-line and batch mode heuristics. Three new heuristics, one for batch and two for on-line, are introduced as part of this research. Simulation studies are performed to compare these heuristics with some existing ones. In total, five on-line heuristics and three batch heuristics are examined. The on-line heuristics consider; to varying degrees and in different ways, task affinity for different machines and machine ready times. The batch heuristics consider these factors, as well as aging of tasks waiting to execute. The simulation results reveal that the choice of mapping heuristic depends on parameters such as: (a) the structure of the heterogeneity among tasks and machines, (b) the optimization requirements, and (c) the arrival rate of the tasks.