This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Time and Parallel Processor Bounds for Fortran-Like Loops
January 1982 (vol. 31 no. 1)
pp. 78-81
R.W. Heuft, Department of Computing Science, University of Alberta
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.
Index Terms:
time and processor bounds, Data dependence, data flow, parallel computation, program analysis, shared variables
Citation:
R.W. Heuft, W.D. Little, "Improved Time and Parallel Processor Bounds for Fortran-Like Loops," IEEE Transactions on Computers, vol. 31, no. 1, pp. 78-81, Jan. 1982, doi:10.1109/TC.1982.1675890
Usage of this product signifies your acceptance of the Terms of Use.