| 基于超立方体的静态任务调度 |
| |
| 引用本文： | 章 军,冯秀山,韩承德.基于超立方体的静态任务调度[J].软件学报,1999,10(12):1275-1278. |
| |
| 作者姓名： | 章 军 冯秀山 韩承德 |
| |
| 作者单位： | 中国科学院计算技术研究所高性能计算机研究中心,北京,100080 |
| |
| 基金项目： | 本文研究得到国家自然科学基金和国家攀登计划项目基金资助. |
| |
| 摘 要： | 该文给出一个基于超立方体的静态任务调度算法.在算法的设计中，首先建立了任务优先级表和处理机优先级表，任务在调度时总是顺次调度高优先级任务，然后再从处理机优先级表中选择能使该任务最早开始执行的处理机.最后，分别给出了基于LU分解的任务图与随机生成的任务图的调度结果.
|
| 关 键 词： | 静态任务调度 超立方体 有向无环图 任务优先级表 虫道寻径 |
| 收稿时间： | 1998/10/12 0:00:00 |
| 修稿时间： | 1998/12/25 0:00:00 |
Static Task Scheduling for Hypercube Interconnected Multicomputers |
| |
| ZHANG Jun,FENG Xiu-shan and HAN Cheng-de.Static Task Scheduling for Hypercube Interconnected Multicomputers[J].Journal of Software,1999,10(12):1275-1278. |
| |
| Authors: | ZHANG Jun FENG Xiu-shan and HAN Cheng-de |
| |
| Affiliation: | Center of High Performance Computing\ Institute of Computing Technology The Chinese Academy of Sciences\ Beijing\ 100080 |
| |
| Abstract: | In this paper, an effective static task scheduling algorithm for hypercube interconnected multicomputers is presented. In the design of this algorithm, two priority lists are built for tasks and processors. During the schedule, tasks are selected from the task priority list in sequence. For a selected task, the processor on which it can be executed the earliest is assigned. In the end, the schedule results of LU decomposition and randomly generated task graphs are given and analyzed. |
| |
| Keywords: | Static task scheduling hypercube directed acirclic graph(DAG) task priority list wormhole routing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
