Segmentation and optimization of programs from cyclic structure analysis

Authors:
Jean-Loup Baer;Robert Caughey
Affiliations:
University of Washington, Seattle, Washington;University of Washington, Seattle, Washington
Venue:
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Year:
1971

Citing 9
Cited 1

On the Boolean Matrix Equation M′=∨i=1Mi

Journal of the ACM (JACM)
Optimal Sequential Partitions of Graphs

Journal of the ACM (JACM)
Automatic segmentation of cyclic program structures based on connectivity and processor timing

Communications of the ACM
An efficient search algorithm to find the elementary circuits of a graph

Communications of the ACM
One way of estimating frequencies of jumps in a program

Communications of the ACM
The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers

ACM '66 Proceedings of the 1966 21st national conference
Graph models of computations in computer systems

Graph models of computations in computer systems
Measurement based automatic analysis of FORTRAN programs

AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Automatic program segmentation based on Boolean connectivity

AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference

Dynamic Characteristics of Loops

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

Modelling of computer programs by directed graphs, where the vertices represent the computational tasks and the arcs show the flow of control, has been used for optimization purposes, parallel processing evaluation, and segmentation. All these studies are mainly based on the fact that a high proportion of the execution time of a program is spent in loops. Although the cyclic structure of programs can be theoretically complex, it has been observed that the nestedness is seldom very deep. Thus if one wants to optimize programs written in a high-level language, the detection of cycles by the compiler and its use in an optimization phase may yield a definite improvement in execution time without having to pay too heavily for excess compiling time. In this paper we show how a compiler could make use of an efficient cycle detection algorithm to model the embeddedness of cycles by an acyclic directed graph. The latter can then be used for packing purposes in case of a paging or "cache" memory system as well as for predicting the expected number of executions of a given statement for optimization purposes.