考虑处理机释放时间的可分任务调度优化模型

Release time aware divisible-load scheduling optimization model

可分任务调度是近年来信息技术领域研究的热点课题.已有的可分任务调度模型大多假设所有处理机在任务分配之初全部处于空闲状态,而实际上,当新的任务到来时很多处理机可能尚处于忙碌状态.每台处理机从忙碌状态转到空闲状态的时间不同,即处理机可能具有不同的释放时间.在充分考虑处理机释放时间不同的基础上,建立了一种新的混合时序约束的可分任务调度模型,并设计了高效的全局优化遗传算法求解该模型.实验结果表明了模型的合理性和算法的有效性.

Divisible-load scheduling has become an increasingly hot subject in the research on information technologies in recent years.Most existing divisible-load scheduling models assume that all processors are idle at the beginning of workload assignment.In fact,many processors may still in the busy state when a new workload arrives.Processors may have different waiting times from the busy state to the idle,that is,processors have different release times.This paper proposes a new release time aware divisible-load scheduling model with hybrid time constraints and designs an effective global optimization genetic algorithm to solve it.Finally,experimental results show the effectiveness of the proposed model and the efficiency of the proposed algorithm.