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.
Similar content being viewed by others
References
Yutze Chow and Etienne Cassignol,Linear Signal-Flow Graphs and Applications, J. Wiley and Sons, 1962.
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.
Donald E. Knuth,The Art of Computer Programming, Addison-Wesley; Vol. 1, 1968; Vol. 2, 1969; Vol. 3, 1973.
Donald E. Knuth,An empirical study of FORTRAN programs, Software Practice and Experience 1 (1971), pp. 105–133.
S. J. Mason,Feedback theory — some properties of signal-flow graphs, Proc. IRE 41 (1953), pp. 1144–1156.
Armen Nahapetian,Node flows in graphs with conservative flow, Submitted for publication.
Edwin H. Satterthwaite,Debugging tools for high level languages, Software Practice and Experience 2 (1972), pp. 197–217.
Author information
Authors and Affiliations
Additional information
Research supported by Norges Almenvitenskapelige Forskningsråd and the U.S. Office of Naval Research. Reproduction in whole or in part is permitted for any purposes of the U. S. Government.
Rights and permissions
About this article
Cite this article
Knuth, D.E., Stevenson, F.R. Optimal measurement points for program frequency counts. BIT 13, 313–322 (1973). https://doi.org/10.1007/BF01951942
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01951942