同时，通过对多处理机任务之间的并行关系的分析，得到了一般最优调度的下界。
At the same time, through the analysis of the parallel relation among the multiprocessor parallel job, the low bound of the optimal schedule has been provided.
该调度算法能够保证任务的调度长度最小，所需处理器数目尽量少，没有处理机间通信开销。
The proposed scheduling algorithm can generate a schedule with the least Scheduled Length and a minimal number of Processors, and without any communication between Processors.
任务调度问题是指根据一定的调度策略，把一组并行处理的任务按规定的时序分配到系统的多个处理机节点上，以期获得较好的系统执行性能。
Task scheduling aims at scheduling a set of partially ordered computational tasks onto a multiprocessor system by a given strategy in order to obtain a better system performance.
文章提出了一种处理机个数无限的任务分配的列表调度算法，称之为节点迁移调度算法(ntsa)。
This paper brings the list scheduling method into the tasking allocation problem on an unbounded number of processors. The proposed algorithm is called node - transferring scheduling algorithm (NTSA).
采用调度算法自动地将任务分配给处理机。
Static task scheduling can be implemented by hand or by algorithms.
采用调度算法自动地将任务分配给处理机。
Static task scheduling can be implemented by hand or by algorithms.
应用推荐