基于超立方体的静态任务调度

Static Task Scheduling for Hypercube Interconnected Multicomputers

该文给出一个基于超立方体的静态任务调度算法 .在算法的设计中 ,首先建立了任务优先级表和处理机优先级表 ,任务在调度时总是顺次调度高优先级任务 ,然后再从处理机优先级表中选择能使该任务最早开始执行的处理机 .最后 ,分别给出了基于 LU分解的任务图与随机生成的任务图的调度结果 .

In this paper, an effective static task scheduling algorithm for hypercube interconnected multicomputers is presented. In the design of this algorithm, two priority lists are built for tasks and processors. During the schedule, tasks are selected from the task priority list in sequence. For a selected task, the processor on which it can be executed the earliest is assigned. In the end, the schedule results of LU decomposition and randomly generated task graphs are given and analyzed.