Computer Science ›› 2008, Vol. 35 ›› Issue (4): 197-199.

Previous Articles     Next Articles

XU Wei-Zhi, WANG Hong-Guo, YU Hui ,YANG Hai (School of Information Seienee and Engineering, Shandong Normal University, Jinan 250014)   

  • Online:2018-11-16 Published:2018-11-16

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 rnak

Key words: Chain of matrix products, Processor allocation, Greedy algorithm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!