Abstract
The linearization of flow charts is considered with particular reference to the extent of the jump structure, resulting from the geometry of the flow chart, that it is necessary to impose on the resulting program. A heuristic method for reducing the amount of time spent on jump instructions is presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. E. Allen,A basis for program optimization, Proc. IFIP Congress 1971, TA-3, 64–68.
E. Ashcroft and Z. Manna,The translation of ‘goto’ programs to ‘while’ programs, Proc. IFIP Congress 1971, TA-2, 147–152.
C. Berge,The theory of graphs and its applications, Methuen, 1962.
E. B. Clark,On the automatic simplification of source-language programs, Proc. 21st Nat. Conf. (ACM) P66 (1966), 313–319.
C. P. Earnest, K. G. Balke and J. Anderson,Analysis of graphs by ordering of nodes, Jour. ACM 19 (1972), 23–42.
A. P. Ershov,On programming of the arithmetic operations, Doklady AN USSR 18 (1968) (English translation).
A. P. Ershov,Theory of program schemata, Proc. IFIP Congress 1971, I144–I163.
R. M. Karp,A note on the application of graph theory to digital computer programming, Information and Control 3, (1960), 179–190.
B. W. Kernighan,Optimal sequential partitions of graphs, Jour. ACM 18 (1971), 34–40.
D. E. Knuth,Fundamental algorithms, The art of Computer Programming, Vol. 1, Sec 2.3.4. Addison-Wesley, 1968.
A. Kurtukov,On optimal arrangements of graphs, ICC (International Computation Centre) Bulletin 6 (1967), 143–159.
E. S. Lowry and C. W. Medlock,Object code optimization, Comm. ACM 12 (1969), 13–22.
Rand,A million random digits with 100,000normal deviates, Rand Corporation, 1955.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boffey, T.B. The linearization of flow charts. BIT 15, 341–350 (1975). https://doi.org/10.1007/BF01931670
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01931670