Utilizing multidimensional loop parallelism on large scale parallel processor systems

Program parallelism and processor allocation issues for parallel processor systems are discussed. Optimal processor assignment algorithms are presented for simple and complex nested parallel loops. These processor assignment schemes can be used by the compiler to perform static processor allocation...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1989-09, Vol.38 (9), p.1285-1296
Main Authors: Polychronopoulos, C.D., Kuck, D.J., Padua, D.A.
Format: Article
Language:English
Subjects:
990210 - Supercomputers- (1987-1989)
Algorithms
Applied sciences
ARRAY PROCESSORS
CALCULATION METHODS
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Concurrent computing
DESIGN
Digital signal processing
Dynamic scheduling
Exact sciences and technology
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
Large-scale systems
Multidimensional systems
OPTIMIZATION
PARALLEL PROCESSING
Processor scheduling
PROGRAMMING
Runtime
Software
Velocity measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Program parallelism and processor allocation issues for parallel processor systems are discussed. Optimal processor assignment algorithms are presented for simple and complex nested parallel loops. These processor assignment schemes can be used by the compiler to perform static processor allocation to multiply nested parallel loops. Speedup measurements for EISPACK and IEEE DSP subroutines that result from the optimal assignment of processors to parallel loops are also presented. These measurements indicate that optimal processor assignments result in almost linear speedups on parallel processor machines with a few tens of processes and significantly high speedups for machines with hundreds or thousands of processors.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.29467