Performance comparison of least slack time based heuristics for job scheduling on computational grid
Performance comparison of least slack time based heuristics for job scheduling on computational grid
复制标题
基于最小松弛时间的启发式计算网格作业调度的性能比较
DOI：
10.1109/iccoins.2014.6868841
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
J. Okitsu
中科院分区：
文献类型：
--
作者：
Ahmad Abba Haruna;N. Zakaria;L. T. Jung;A. J. Pal;K. Naono;J. Okitsu
近年来，人们对计算的需求不断增长，导致了计算网格的发展.通常，调度挑战往往是NP难问题，没有最佳解决方案。因此，这里报道的研究集中在开发的混合动力调度算法的基础上的最后期限和松弛时间参数及其变化，使用优化技术的概念。一个广泛的性能比较已经提出了使用真实的工作负载跟踪作为基准的网格计算环境。与现有文献中的一些基线调度方法的结果进行了比较。结果表明，本文中开发和报告的网格调度算法的性能在大多数情况下得到了良好的结果，也支持真正的可扩展性，当在计算网格环境中的工作量和处理器数量增加的情况下。
In recent years, increasing demand for computing has led to the development of computational grid. Typically scheduling challenges tend to be NP-hard problems where there is no optimal solution. The research reported here therefore is focused on the development of hybrids scheduling algorithms based on deadline and slack time parameters and its variations, using the concept of optimization techniques. An extensive performance comparison has been presented using real workload traces as benchmark on a grid computational environment. The results were compared with some baseline scheduling approaches in extant literature. The results have shown that the performances of grid scheduling algorithms developed and reported in this paper give good results in most of the cases and also support true scalability, when in the scenario of increasing workload and number of processors on a computational grid environment.