Utilizing multidimensional loop parallelism on large scale parallel processor systems
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (9) , 1285-1296
- https://doi.org/10.1109/12.29467
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel SupercomputersIEEE Transactions on Computers, 1987
- Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup BoundsIEEE Transactions on Computers, 1987
- On program restructuring, scheduling, and communication for parallel processor systemsPublished by Office of Scientific and Technical Information (OSTI) ,1986
- Hardware Task/Processor Scheduling in a Polyprocessor EnvironmentIEEE Transactions on Computers, 1984
- Dependence graphs and compiler optimizationsPublished by Association for Computing Machinery (ACM) ,1981
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977