该文给出一个基于超立方体的静态任务调度算法 .在算法的设计中 ,首先建立了任务优先级表和处理机优先级表 ,任务在调度时总是顺次调度高优先级任务 ,然后再从处理机优先级表中选择能使该任务最早开始执行的处理机 .最后 ,分别给出了基于 LU分解的任务图与随机生成的任务图的调度结果 . This paper presents a hypercube-based static task scheduling algorithm.In the design of the algorithm, the task priority table and the processor priority table are established first, and the task is always to schedule high priority tasks in turn, and then Select the processor that can make the task start as soon as possible from the processor priority table.Finally, we give the scheduling results of task graph and random generated task graph respectively based on LU decomposition.