BIT Numerical Mathematics

, Volume 13, Issue 3, pp 313–322 | Cite as

Optimal measurement points for program frequency counts

  • Donald E. Knuth
  • Francis R. Stevenson
Article

Abstract

A procedure recently devised by A. Nahapetian, for reducing the number of measurements needed to determine all the execution frequencies in a computer program, is shown to be optimal, by interpreting the procedure in a new way.

Keywords

Computer Program Computational Mathematic Measurement Point Frequency Count Optimal Measurement 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yutze Chow and Etienne Cassignol,Linear Signal-Flow Graphs and Applications, J. Wiley and Sons, 1962.Google Scholar
  2. 2.
    Daniel Ingalls,The execution time profile as a programming tool, in R. Rustin (ed.)Compiler Optimization, 2nd Courant Computer Science Symposium (1970), Prentice-Hall, 1972, pp. 107–128.Google Scholar
  3. 3.
    Donald E. Knuth,The Art of Computer Programming, Addison-Wesley; Vol. 1, 1968; Vol. 2, 1969; Vol. 3, 1973.Google Scholar
  4. 4.
    Donald E. Knuth,An empirical study of FORTRAN programs, Software Practice and Experience 1 (1971), pp. 105–133.Google Scholar
  5. 5.
    S. J. Mason,Feedback theory — some properties of signal-flow graphs, Proc. IRE 41 (1953), pp. 1144–1156.Google Scholar
  6. 6.
    Armen Nahapetian,Node flows in graphs with conservative flow, Submitted for publication.Google Scholar
  7. 7.
    Edwin H. Satterthwaite,Debugging tools for high level languages, Software Practice and Experience 2 (1972), pp. 197–217.Google Scholar

Copyright information

© BIT Foundations 1973

Authors and Affiliations

  • Donald E. Knuth
    • 1
    • 2
  • Francis R. Stevenson
    • 1
    • 2
  1. 1.The University of OsloOsloNorway
  2. 2.The Norwegian Computing CenterOsloNorway

Personalised recommendations