摘要
多处理机系统MPS(MultiprocessorSystem)上作业的分配和调度问题是其运行效率的关键.本文讨论的是具有不相容性作业集的作业分配和调度问题,提出了一种启发式方法及其定量分析技术。
In this paper, we present a heuristic scheduling algorithm for MPS (Multi Processor System)with incompatible jobs, and the performance analysis of this algorithm. Some scheduling problem can be solved based on the heuristic method in polynomial time complexity when the job graphs have some special structures such as bipartite graph,tree and so on.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2000年第1期102-105,共4页
Systems Engineering-Theory & Practice
基金
湖北省自然科学基金
