摘要
本文针对顺序程序并行转换过程所产生的任务流图,在一定近似假定条件下,利用A~*算法给出了一有效最佳分配算法,使系统获得最大加速比。
Refering to the tasks flow graph (TFG) produced by the procedure translatinga sequential program into a parallel form, based on an approximate assumption, an optimalscheduling algorithm for the TFG is presented by using the A algorithm. It gives an assurance that the system gain the maximal speedup.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1989年第5期22-27,共6页
Acta Electronica Sinica
