Advertisement

Processing Systems Optimization through Automatic Design and Reorganization of Program Modules

  • J. F. NunamakerJr.
  • William C. NylinJr.
  • Benn KonsynskiJr.

Abstract

A methodology is described for the automatic design and optimization of program modules. Processes and files are grouped and reorganized in such a way as to produce an optimal design with respect to a specific target machine. Performance criteria for the optimal design is defined in terms of four components: (1) processing time, (2) transport volume, (3) core size, and (4) number and type of I/O units required.

Keywords

Transport Volume Program Module Reachability Matrix Incidence Graph Core Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. F. Nunamaker, Jr.,On the Design and Optimization of Information Processing Systems, Ph.D. Diss., Case Institute of Technology (March 1969).Google Scholar
  2. 2.
    J. F. Nunamaker, Jr., A Methodology for the Design and Optimization of Information Processing Systems, inAFIPS Proc., Spring Joint Computer Conf, Vol.38(May 1971).Google Scholar
  3. 3.
    Borge Langefors, Information System Design Computations Using Generalized MatrixAlgebra BIT 5(2) (1965).Google Scholar
  4. 4.
    R. B. Briggs,A Mathematical Model for the Design of Information Management Systems, M.S. Thesis, Univ. of Pittsburgh (1966).Google Scholar
  5. 5.
    Glenn Graves and A. Whinston, An Algorithm for the Quadratic Assignment Problem,Management Sci.17(7) (March 1970).Google Scholar
  6. 6.
    W. C. Nylin, Jr.,Structural Reorganization of Multipass Computer Programs, Ph.D. Diss., Purdue Univ. (June 1972).Google Scholar
  7. 7.
    A. P. Yershov, ALPHA—An Automatic Programming System of High Efficiency,J. ACM 13(January), 17 (1966).CrossRefGoogle Scholar
  8. 8.
    A. P. Yershov,The ALPHA Automatic Programming System, Academic Press, New York (1971).Google Scholar
  9. 9.
    R. T. Prosser, Application of Boolean Matrices to the Analysis of Flow Diagrams, inProc. Eastern Joint Computer Conf. (1959), p. 133.Google Scholar
  10. 10.
    John Cocke and J. T. Schwartz.Programming Languages and Their Compilers, 2nd Rev. Version, Courant Institute of Mathematical Sciences, New York University (1969).Google Scholar
  11. 11.
    Frances E. Allen, Control Flow Analysis,ACM SIGPLAN Notices,5(July), 1 (1970).CrossRefGoogle Scholar
  12. 12.
    Frances E. Allen, Control Flow Analysis,ACM SIGPLAN Notices,5(July), 1 (1970).Google Scholar
  13. 13.
    Edward S. Lowery and C. W. Medlock, Object Code Optimization,Commun. ACM 12(January), 13 (1969).CrossRefGoogle Scholar
  14. 14.
    Samuel F. Mendicino et al., The LRLTRAN Compiler,Commun. ACM 11(November), 747 (1968).CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1974

Authors and Affiliations

  • J. F. NunamakerJr.
    • 1
  • William C. NylinJr.
    • 2
  • Benn KonsynskiJr.
    • 1
  1. 1.Purdue UniversityLafayetteUSA
  2. 2.Southern Methodist UniversityDallasUSA

Personalised recommendations