摘要
研究了在异构计算系统(HCS)中利用表调度式算法进行任务映射与调度.给出两种异构静态优先级表调度式任务映射算法(HSP和GHSP),以及一种异构动态优先级表调度式任务映射算法(BHDP).实验结果表明,GHSP算法对于粗中粒度DAG的调度效果稍好于HSP算法,而BHDP算法对于粗粒度和细粒度DAG的调度效果均明显优于HSP和GHSP算法.
This paper describes how to carry out task mapping and scheduling in heterogeneous computing system (HCS) using list scheduling algorithms. Two kinds of static (HSP Heterogeneous Sta tic Priority and GHSP Greedy Heterogeneous Static Priority) and one dynamic (BHDP Basic Heterogeneous Dynamic Priority) heterogeneous task mapping algorithms based on priority list scheduling are presented. The testing results indicate that the scheduling effect of GHSP algorithm is better than HSP algorithm for medium and coarse grain DAG, while the scheduling effect of BHDP algorithm clearly outperforms the HSP and GHSP for both coarse and fine grain DAGs.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
1998年第10期53-57,共5页
Journal of Shanghai Jiaotong University
基金
国家自然科学基金
关键词
任务映射
任务凋度
异构计算系统
表调度式算法
heterogeneous computing
task mapping
task scheduling
network parallel computing