Multiprocessor Scheduling Problem ( MSP ) is one of the basic problems in "The Design and Analysis of computer Algorithms" , and is a NP-Problem.
多处理机调度问题是“算法设计与分析”中的基本问题之一，它是一个NP问题。
This is a new combinatorial optimization problem which has many applications in practice, such as in multiprocessor scheduling and real-world transportation.
该问题是一个新的组合优化问题，来源于多处理器任务调度。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
The memory structure, constitution of data communication channel and system bus are analyzed, and the algorithm allocating, algorithm mapping and scheduling on the multiprocessor are discussed.
对系统的存储器结构、数据通信通道组成和系统总线结构进行了分析； 讨论了算法划分、算法的多处理器映射及调度；
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.
任务调度问题是指根据一定的调度策略，把一组并行处理的任务按规定的时序分配到系统的多个处理机节点上，以期获得较好的系统执行性能。
This paper focuses on scheduling unit length multiprocessor tasks with de-creasing chain precedence constrains on three identical processors so as to minimize makespan.
研究三个并行处理器环境中，具有递减链约束的多处理器任务的调度问题，调度目标是最小化总处理时间，假设单项任务需单位处理时间。
In the multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital.
在多处理器系统中，寻求一个有效的并行任务设计安排使得整个执行时间达到最小是至关重要的环节。
In the multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital.
在多处理器系统中，寻求一个有效的并行任务设计安排使得整个执行时间达到最小是至关重要的环节。
应用推荐