| 引用本文: | 曹介南,杜铁塔.任务划分与处理机调度的递归-分治方法.[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[点击复制] |
|
| |
|
|
| 本文已被：浏览 5958次 下载 6195次 |
| 任务划分与处理机调度的递归-分治方法 |
| 曹介南, 杜铁塔 |
|
(国防科技大学 电子计算机系 湖南 长沙 410073)
|
| 摘要: |
| 本文介绍并实现了一种如何把一个顺序执行的任务集，根据其子任务之间潜在的并行性，划分成若干个可并发执行的任务子集，并把每个子集分配给一个处理机，使各处理机之间的数据通信量尽可能地少，同时兼顾各处理机之间负载平衡的算法。最后给出了几个典型例题的试算结果，为了满足用户的不同要求，文章还提出了几点改进方法。 |
| 关键词: 多任务划分，处理机调度，机间通信，负载平衡，递归-分治，受益值 |
| DOI： |
| 投稿日期：1992-07-08 |
| 基金项目: |
|
| The Method of Recursive Divide for Task Partition and Processor Scheduling |
| Cao Jienan, Du Tieta |
|
(Department of Computer Science，NUDT，Changsha 410073)
|
| Abstract: |
| 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. |
| Keywords: task partition,processor scheduling,communication between the processors,balance of load,recursive-divide,gain |
|
|
