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

Distributing Divisible Task in a Ring of Processors

作　　者：李国东[1] 杨海荣[1] 王东奎[1] 张德富[1] 

机构地区：[1]南京大学计算机软件新技术国家重点实验室,南京210093

出　　处：《计算机科学》2002年第2期14-16,71,共4页Computer Science

摘　　要：1.介绍近年来关于并行计算的研究十分活跃,并行任务的分配和调度策略是研究的热点之一.最近可分解任务(divisibletask)的概念[1]被提出来,对它在并行系统上的分配策略亦进行了许多研究.可分解任务是这样的任务:它可被分解成多个任意大小的子任务,每个子任务在不同处理机上运行,由于这些子任务来自于同一个任务,它们在处理机上的处理类型是相同的.This paper is about distributed processing of a divisible task in a ring of communicating processors, all works are based on ring topology. Our 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 parallel 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.

关 键 词：环形互连并行系统 任务分配 并行计算机系统 调度策赂 处理器 

分 类 号：TP338.6[自动化与计算机技术—计算机系统结构]