| LSA_IT:一种In-Tree任务图的分层调度算法 |
| |
| 引用本文： | 张艳,李延红. LSA_IT:一种In-Tree任务图的分层调度算法[J]. 计算机工程与应用, 2006, 42(31): 23-24,63 |
| |
| 作者姓名： | 张艳 李延红 |
| |
| 作者单位： | 深圳大学,信息工程学院,广东,深圳,518060;深圳大学,信息工程学院,广东,深圳,518060 |
| |
| 摘 要： | In-Tree任务图可用来求解归并排序、求和等分治问题的并行。针对该类任务图,提出了一种分层调度算法——LSA_IT。它对任务图逐层调度。调度中,根据优先级,保证任务的最优前驱被优先调度,并在不影响调度长度的同时,将任务尽可能地调度到其已调度兄弟所在处理器上。实验表明,与TDS、DCP、MCP算法相比,LSA_IT的调度性能最优。
|
| 关 键 词： | 任务调度 有向无环图 调度长度 In-Tree |
| 文章编号： | 1002-8331（2006）31-0023-02 |
| 收稿时间： | 2006-01-01 |
| 修稿时间： | 2006-01-01 |
LSA_IT :Layered Scheduling Algorithm for In-Tree Task Graph |
| |
| ZHANG Yan,LI Yan-hong. LSA_IT :Layered Scheduling Algorithm for In-Tree Task Graph[J]. Computer Engineering and Applications, 2006, 42(31): 23-24,63 |
| |
| Authors: | ZHANG Yan LI Yan-hong |
| |
| Affiliation: | School of Information Engineering, Shenzhen University, Shenzhen, Guangdong 518060, China |
| |
| Abstract: | The In-Tree task graph can be used to solve the parallel of divide-and-conquer problems,such as merging sorting and summing etc.Specially aiming at this kind of task graph,this paper proposes a layered algorithm,called LSA_IT.It schedules the task graph by level.During the scheduling,according to the priority,it guarantees the most superior predecessor of task is firstly scheduled,and allocates the nodes to the processors of its scheduled sibling as possible without changing the scheduling length.The experiment shows,by comparing with TDS,DCP,MCP,LSA_IT has the best scheduling performance. |
| |
| Keywords: | In-Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
