PARTITIONING AND MAPPING OF NESTED LOOPS FOR LINEAR-ARRAY MULTICOMPUTERS

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Electrical Engineering > journal & Dissertation > Item 987654321/29394

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29394

Title:	PARTITIONING AND MAPPING OF NESTED LOOPS FOR LINEAR-ARRAY MULTICOMPUTERS
Authors:	SHEU,JP;CHEN,TS
Contributors:	電機工程研究所
Keywords:	MULTIPROCESSOR SYSTEMS;PARALLEL
Date:	1995
Issue Date:	2010-06-29 20:23:38 (UTC+8)
Publisher:	中央大學
Abstract:	In distributed-memory multicomputers, minimizing interprocessor communication is the key to the efficient execution of parallel programs. In order to reduce the amount of communication overhead, parallel programs on multicomputers must be carefully scheduled by parallelizing compilers. This paper proposes some compilation techniques for partitioning and mapping nested loops with constant data dependences onto linear array multicomputers. First, a systematic partition strategy is proposed to project an n-dimensional computational structure, representing an n-nested loop, onto a line to form a one-dimensional projected structure with low communication overhead. Then, a mapping algorithm is proposed for mapping the partitioned loops onto linear arrays in a way that balances the workload and minimizes the communication cost among processors. Finally, parallel execution codes can be automatically generated for such linear array multicomputers.
Relation:	JOURNAL OF SUPERCOMPUTING
Appears in Collections:	[Graduate Institute of Electrical Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	571	View/Open

社群 sharing