Simulation of MJ_CDTmin based Scheduling Algorithm in Grid Environment
Simulation of MJ_CDTmin based Scheduling Algorithm in Grid Environment
复制标题
网格环境下基于MJ_CDTmin的调度算法仿真
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Anik Gupta
中科院分区：
文献类型：
--
作者：
Deepti Malhotra;Devanand;Anik Gupta
为了实现巨大的分布式资源的巨大潜力，有效和高效的调度算法是至关重要的。传统的并行和分布式系统通常运行在同构和专用的资源上，如计算机集群，调度算法不能很好地工作在新的环境中。本文提出了一种新的网格作业调度算法MJ_CDTmin（multiple jobs based on the minimum cumulative departure time），该算法基于下一个作业到达处理机的累积到达时间与处理机的最小累积离开时间的比较规则。提出的调度算法的主要目的是提高系统的效率，以满足从可用资源的作业要求。在这项研究工作中，所提出的算法已经实现和验证。为了证明所提出的技术的可用性，一个仿真测试台，使用Turbo C平台和成功的仿真实现。实验结果表明，一个较小的完工时间方面的显着改善相比，已经存在的FCFS调度算法。
To achieve the promising potentials of tremendous distributed resources, effective and efficient scheduling algorithms are fundamentally important. Unfortunately, scheduling algorithms in traditional parallel and distributed systems, which usually run on homogeneous and dedicated resources, e.g. computer clusters, cannot work well in the new circumstances. In this research paper, we introduce a New Grid Job Scheduling algorithm MJ_CDTmin (multiple jobs based on the minimum cumulative departure time).The MJ_CDTmin is based on the rule that the cumulative arrival time of the next job arriving at the processor is compared with the minimum cumulative departure time of the processor. The main aim of proposed scheduling algorithm is to increase the system efficiency and to satisfy the job requirements from the available resources. In this research work the proposed algorithm has been implemented and validated. To demonstrate the usability of proposed techniques, a Simulation test bench was implemented using the Turbo C platform and successful simulation was achieved. The experimental results showed a significant improvement in terms of a smaller makespan time as compared to the already existing FCFS scheduling algorithm.