PARTITIONING AND MAPPING NESTED LOOPS ON MULTIPROCESSOR SYSTEMS

NCU Institutional Repository > 資訊電機學院 > 電機工程研究所 > 期刊論文 > Item 987654321/29479

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29479

题名:	PARTITIONING AND MAPPING NESTED LOOPS ON MULTIPROCESSOR SYSTEMS
作者:	SHEU,JP;TAI,TH
贡献者:	電機工程研究所
关键词:	PARALLEL ALGORITHMS;SYSTOLIC ARRAYS;DESIGN
日期:	1991
上传时间:	2010-06-29 20:25:48 (UTC+8)
出版者:	中央大學
摘要:	Intensive scientific algorithms can usually be formulated as nested loops which are the main source of parallelism. When a nested loop is executed in parallel, the total execution time is composed of two parts-the computation time and the communication time. For a message-passing multiprocessor system, performance declines rapidly as the communication overhead is higher than the corresponding computation. In this paper, a method for parallel executing nested loops with constant loop-carried dependencies on message-passing multiprocessor systems to reduce the communication overhead is presented. First, we partition the nested loop into blocks which result in little communication without concern for the topology of machines. For a given linear time transformation found by the hyperplane method, the iterations of a nested loop are partitioned into blocks such that the communication among the blocks is reduced while the execution ordering defined by the time transformation is not perturbed. Then, the partitioned blocks generated by the partitioning method are mapped onto multiprocessor systems according to the specific properties of various machines. We propose a heuristic mapping algorithm for the hypercube machines.
關聯:	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
显示于类别:	[電機工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	434	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....