| 解决矩阵链相乘处理器调度问题的一种新算法 |
| |
| 引用本文： | 徐卫志 王洪国 于惠 杨海. 解决矩阵链相乘处理器调度问题的一种新算法[J]. 计算机科学, 2008, 35(4): 197-199 |
| |
| 作者姓名： | 徐卫志 王洪国 于惠 杨海 |
| |
| 作者单位： | 山东师范大学信息科学与工程学院,济南,250014 |
| |
| 摘 要： | 本文介绍了矩阵链相乘处理器分配问题和离散处理器分配算法,描述了Lee Heejo等人提出的解决MCSP的处理器分配算法,提出了一种解决MCSP的时间复杂度更低的算法,使处理器能尽量被充分利用,并对三种分配算法进行了比较分析.
|
| 关 键 词： | 矩阵链相乘 处理器分配 贪心算法 |
A New Algorithm to Solve the MCSP |
| |
| XU Wei-Zhi,WANG Hong-Guo,YU Hui,YANG Hai (School of Information Seienee and Engineering,Shandong Normal University,Jinan. A New Algorithm to Solve the MCSP[J]. Computer Science, 2008, 35(4): 197-199 |
| |
| Authors: | XU Wei-Zhi WANG Hong-Guo YU Hui YANG Hai (School of Information Seienee Engineering Shandong Normal University Jinan |
| |
| Abstract: | In this paper, the matrix chain scheduling problem and two discrete processor allocation algorithms are introduced. Then the algorithm which was proposed by Lee Heejo is described. At last, a new greedy algorithm is proposed,which costs less time and make good use of the processors, and three allocation algorithms are compared and analysed. |
| |
| Keywords: | Chain of matrix products Processor allocation Greedy algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
