Independent partitioning of algorithms with uniform dependencies

Author

Shang, Weijia ; Fortes, Jose A B

Author_Institution

Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA

Volume

41

Issue

2

fYear

1992

fDate

2/1/1992 12:00:00 AM

Firstpage

190

Lastpage

206

Abstract

Uniform dependence algorithms with arbitrary index sets are considered, and two computationally inexpensive methods to find their independent partitions are proposed. Each method has advantages over the other one for certain kinds of applications, and they both outperform previously proposed approaches in terms of computational complexity and/or optimality. Also, lower and upper bounds are given for the cardinality of maximal independent partitions. In multiple instruction multiple data (MIMD) systems, if different blocks of an independent partition are assigned to different processors, communications between processors will be minimized to zero. This is significant because the communications usually dominate the overhead in MIMD machines

Keywords

computational complexity; parallel algorithms; MIMD machines; cardinality; computational complexity; index sets; lower bounds; maximal independent partitions; multiple instruction multiple data; optimality; uniform dependence algorithms; upper bounds; Algorithm design and analysis; Computational complexity; Concurrent computing; Data communication; Optimizing compilers; Partitioning algorithms; Programming profession; Upper bound; Vectors; Very large scale integration;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.123395

Filename

123395