This Article 
 Bibliographic References 
 Add to: 
Time and Parallel Processor Bounds for Fortran-Like Loops
September 1979 (vol. 28 no. 9)
pp. 660-670
U. Banerjee, Department of Computer Science, University of Illinois
The main goal of this paper is to show that a large number of processors can be used effectively to speed up simple Fortran-like loops consisting of assignment statements. A practical method is given by which one can check whether or not a statement is dependent upon another. The dependence structure of the whole loop may be of different types. For each type, a set of time and processor upper bounds is given. We also show how a loop can sometimes be transformed to change its dependence structure. Finally, we give a result on the possible splitting up of a given recurrence system into a number of smaller subsystems. These results can be used to modify and sometimes improve the bounds for the loops as demanded by special circumstances.
Index Terms:
time bounds, Analysis of programs, data dependence, Fortran-like loops, parallel computation, processor bounds, program speedup, recurrence relations
U. Banerjee, null Shyh-Ching Chen, D.J. Kuck, R.A. Towle, "Time and Parallel Processor Bounds for Fortran-Like Loops," IEEE Transactions on Computers, vol. 28, no. 9, pp. 660-670, Sept. 1979, doi:10.1109/TC.1979.1675434
Usage of this product signifies your acceptance of the Terms of Use.