摘要
提出一种新的元任务调度算法。该算法根据网格中当前可用的计算资源、存储资源和元任务对这些资源的不同需求,选择一些任务预先分配到其中的一种资源上;再根据运行时另一种资源的可用情况,调整预分配任务运行顺序和给未预分配的任务分配资源,平衡计算资源和存储资源的负载并使元任务的完成时间趋向最短。
The article presents a new meta-task scheduling algorithm. Based on the analysis of availability of computing resources and storage resources and requirements of meta-task for them, the scheduling algorithm first allocates one of computing resources or storage resources to some tasks. Afterwards the algorithm adjusts the sequence in which the scheduled tasks executes and continues to allocate resources to some other tasks according to the runtime status of another resource, balancing the loads between computing resources and storage resources and minimizing the makespan of meta-task.
出处
《计算机应用与软件》
CSCD
北大核心
2007年第3期148-149,168,共3页
Computer Applications and Software
关键词
网格
元任务
调度算法
完成时间
Grid Meta-task Scheduling algorithm Makespan
