摘要
缩短程序的执行时间是并行处理的首要目标 ,有效的任务分配算法是实现这一目标的关键 ,对机群系统来说更是如此 .研究机群系统上针对结构化并行控制机制的任务调度问题 ,并基于贪心算法、粒度控制、反馈式分派的原则 ,提出近优的任务调度算法 SSA(sub- optimal scheduling algorithm) .实验结果表明 ,在机群环境下 ,该算法的并行计算性能与其他算法相比均有所提高 .
Reducing the execution time of program is a main goal of parallel processing, while an efficient task allocation algorithm is a crucial step, especially on NOW (network of workstations). In this paper, the problem of task scheduling in structural parallel control mechanism on heterogeneous net of workstations is studied. Based on principles of greedy algorithm, granularity controlling and feeding back liked assignment, an algorithm on scheduling tasks is put forward under structural parallel mechanism: SSA (sub optimal scheduling algorithm). The experimental results show that it can get better performance than other algorithms on heterogeneous NOW.
出处
《软件学报》
EI
CSCD
北大核心
2001年第5期706-710,共5页
Journal of Software
基金
国家"九五"国防预研基金资助项目 (16 .1.3.3)&&
关键词
任务调度算法
结构化并行控制
机群系统
并行处理
task scheduling
parallel processing
parallel compiling
NOW (network of workstations)
