首页   按字顺浏览 期刊浏览 卷期浏览 FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION*
FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION*

 

作者: BALARAM SINHAROY,   BOLESLAWK. SZYMANSKI,  

 

期刊: Parallel Algorithms and Applications  (Taylor Available online 1994)
卷期: Volume 2, issue 1-2  

页码: 5-26

 

ISSN:1063-7192

 

年代: 1994

 

DOI:10.1080/10637199408915404

 

出版商: Taylor & Francis Group

 

关键词: Parallel programming;data dependence;algorithm transformation;uniform dependence algorithm;compile-time scheduling;hyperplane;D.1.3;D.3.4;D.4.1

 

数据来源: Taylor

 

摘要:

Data parallelism, in which the same operation is performed on many elements of an n-dimensional array, is one of the most powerful methods of extracting parallelism in scientific computation. One form of data parallelism involves defining a sequence of parallel wavefronts of a computation. Each wavefront consists of an (n - l)-dimcnsional subarray of the evaluated array and all wavefront elements are evaluated simultaneously. Different wavefronts result in different performance, so the question arises how to determine the wavefronts that result in the minimum computation time. Wavefront determination should define also allocation of wavefront elements to processors.

 

点击下载:  PDF (355KB)



返 回