Improved Time and Parallel Processor Bounds for Fortran-Like Loops
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (1) , 78-81
- https://doi.org/10.1109/tc.1982.1675890
Abstract
Dynamic characteristics of program execution must be studied in order to calculate meaningful time and parallel processor bounds. The paper entitled "Time and Parallel Processor Bounds for Fortran-Like Loops" [1] studies only the static interaction between statements within a program to arrive at these bounds. Consequently, very loose bounds are obtained for certain programs. Improved estimates of time and processor bounds are provided for two of the example programs presented in the above-mentioned paper. These estimates are based on an expression of the relationship between operations which calculate values and operations which later use those values as operands.Keywords
This publication has 3 references indexed in Scilit:
- Time and Parallel Processor Bounds for Fortran-Like LoopsIEEE Transactions on Computers, 1979
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- A computer architecture for highly parallel signal processingPublished by Association for Computing Machinery (ACM) ,1974