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.
同时，通过对多处理机任务之间的并行关系的分析，得到了一般最优调度的下界。
Multiprocessor Scheduling Problem ( MSP ) is one of the basic problems in "The Design and Analysis of computer Algorithms" , and is a NP-Problem.
多处理机调度问题是“算法设计与分析”中的基本问题之一，它是一个NP问题。
Multiprocessor Scheduling Problem ( MSP ) is one of the basic problems in "The Design and Analysis of computer Algorithms" , and is a NP-Problem.
多处理机调度问题是“算法设计与分析”中的基本问题之一，它是一个NP问题。
应用推荐