Improved Time and Parallel Processor Bounds for Fortran-Like Loops

Authors:
R. W. Heuft;W. D. Little
Affiliations:
Department of Computing Science, University of Alberta;-
Venue:
IEEE Transactions on Computers
Year:
1982

Citing 3
Cited 1

Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Time and Parallel Processor Bounds for Fortran-Like Loops

IEEE Transactions on Computers
A computer architecture for highly parallel signal processing

ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2

A Survey of Parallel Machine Organization and Programming

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	14.98

Visualization

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.