摘要
若干台处理机完成一批任务所需要的最少时间称为完工时间.一般地,当任务数目小于处理机数目时,为了提高处理机的利用率,缩短处理机完成所有任务的完工时间,可以把每项任务预先平均分成几个部分,再放到处理机上使用并行算法进行加工,这样使完工时间尽可能小.文中具体给出了在此情况下的完工时间.
The minimum time that needs to execute a batch of tasks is called makespan.In general,when the number of tasks is less than that of parallel processors,it is profitable to partition in average each task T_i into p_i parts with some expansion factors and then execute all new parts by the devised parallel algorithm so as to obtain the execution time which is close to the makespan.The makespan of scheduling some tasks in the partitionable model is given.
出处
《云南大学学报（自然科学版）》
CAS
CSCD
2004年第2期103-106,共4页
Journal of Yunnan University(Natural Sciences Edition)
基金
国家自然科学基金资助项目(10271103).
