In this paper,we present an efficient method for task partition and processor scheduling by the method we can divide a set of sequential tasks into many subsets,which can be performed parallel in its processor. Both the communication between the processors approaching to the low critical of the problem,and the balance of the load in processor are good.
参考文献
相似文献
引证文献
引用本文
曹介南,杜铁塔.任务划分与处理机调度的递归-分治方法[J].国防科技大学学报,1994,16(1):66-73. Cao Jienan, Du Tieta. The Method of Recursive Divide for Task Partition and Processor Scheduling[J]. Journal of National University of Defense Technology,1994,16(1):66-73.