| 基于二分图匹配的一类多机调度问题研究 |
| |
| 引用本文： | 张超,曾显华,齐凯隆.基于二分图匹配的一类多机调度问题研究[J].教育技术导刊,2009(7). |
| |
| 作者姓名： | 张超 曾显华 齐凯隆 |
| |
| 作者单位： | 中南大学信息科学与工程学院; |
| |
| 摘 要： | 二分图是图论当中一种特殊的模型,求带权二分图的最佳匹配算法对许多具有最优解的实际应用问题的解决是准确和高效的。针对多机系统的操作系统的一类多机调度问题进行了分析,建立了该问题的二分图模型并给出了二分图匹配的算法,对所给算法的复杂度进行了分析和讨论。实验结果验证了所提出方法的有效性。
|
| 关 键 词： | 二分图 匹配 最优解 多机调度问题 |
Research of a Class of Scheduling Problem of Multicomputer Based on Bipartite Graph Matching |
| |
| Abstract: | The Bipartite Graph is a special kind of model in the graph theory, the algorithm of solving the best matching of the weighted bipartite graph is a accurate and high-efficient method to many problems which have the best method. In this paper,a kind of scheduling problem of multicomputer is brought up firstly. And then a modal of Bipartite Graph for this problem is build and an novel algorithm for this problem based on Bipartite Graph Matching is proposed. Finally,the complexity of the proposed algorithm is ... |
| |
| Keywords: | Bipartite Graph Matching Best Method Scheduling Problem of Multicomputer |
| 本文献已被 CNKI 等数据库收录！ |
|
