Grain size determination for parallel processing
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Software
- Vol. 5 (1) , 23-32
- https://doi.org/10.1109/52.1991
Abstract
A method called grain packing is proposed as a way to optimize parallel programs. A grain is defined as one or more concurrently executing program modules. A grain begins executing as soon as all of its inputs are available, and terminates only after all of its outputs have been computed. Grain packing reduces total execution time by balancing execution time and communication time. Used with an optimizing scheduler, it gives consistently better results than human-engineered scheduling and packing. The method is language-independent and is applicable to both extended serial and concurrent programming languages, including Occam, Fortran, and Pascal.Keywords
This publication has 5 references indexed in Scilit:
- Parallel Processing with Large-Grain Data Flow TechniquesComputer, 1984
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Optimal Scheduling Strategies in a Multiprocessor SystemIEEE Transactions on Computers, 1972
- A survey of techniques for recognizing parallel processable streams in computer programsPublished by Association for Computing Machinery (ACM) ,1969
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961