环形互连并行系统上的任务分配

This paper is about distributed processing of a divisible task in a ring of communicating processors,all works are based on ring topology.Out distribution scheme aims to guarantee minimal finish time of the whole task,which is divided into parts (subtasks)and scheduled to the individual processors.In our model the communication startup time and delay time are both taken into consideration;we also discuss the cases of returning results or not as well as sending data in prallel or not,and returning results through the ring are our focus for discussion.The volume of subtask assigned to each processor is gotten after creating and solving the linear equations.At last the empirical results are presented.

Distributing Divisible Task in a Ring of Processors