| CCTD：一种通信限制下的Fork-Join任务调度算法 |
| |
| 引用本文： | 梁珊珊 吴佳骏 张军超. CCTD：一种通信限制下的Fork-Join任务调度算法[J]. 计算机科学, 2009, 36(6): 282-285 |
| |
| 作者姓名： | 梁珊珊 吴佳骏 张军超 |
| |
| 作者单位： | 中国科学院计算技术研究所,北京,100080 |
| |
| 摘 要： | 现代并行系统的复杂调度问题可以转化为Fork-join图的任务调度问题.然而在实际计算环境中,两个处理节点之间的通信大多以独占方式进行,现有的大多数任务调度算法往往忽略了对通信信道独占性的考虑.提出了一种带通信限制的Fork-join图调度算法CCTD.该算法引入了实际环境中的通信独占性限制,同时保证了Fork-join图的基于复制的优化调度,而且尽可能地减少了对处理器占用.实验结果表明,CCTD算法是一种适应性强的、高效的Fork-join图调度算法.
|
| 关 键 词： | 任务调度 任务复制 通信限制 |
| 收稿时间： | 2008-11-18 |
| 修稿时间： | 2009-01-06 |
CCTD:A Scheduling Algorithm under Communication Constraints for Fork-Join Task Graphs |
| |
| LIANG Shan-shan WU Jia-jun ZHANG Jun-chao (Institute of Computing Technology,Chinese Academy of Sciences,Beijing,China. CCTD:A Scheduling Algorithm under Communication Constraints for Fork-Join Task Graphs[J]. Computer Science, 2009, 36(6): 282-285 |
| |
| Authors: | LIANG Shan-shan WU Jia-jun ZHANG Jun-chao (Institute of Computing Technology Chinese Academy of Sciences Beijing China |
| |
| Affiliation: | Institute of Computing Technology;Chinese Academy of Sciences;Beijing 100080;China |
| |
| Abstract: | All the complicated scheduling problems in modern parallel systems can be converted to the basic scheduling problem for Fork-Join task graphs.However,the communication between two processing nodes is carried on exclusively in real computation environment,which are normally ignored by most task scheduling algorithms.This paper presentsed a scheduling algorithm under communication constraints for Fork-Join task graphs.The algorithm provided a duplication based approach to schedule Fork-Join task graph while i... |
| |
| Keywords: | fork-join |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
