Determining Average Program Execution Times and Their Variance

ACM SIGPLAN Notices

Volumn 24, Issue 7, 1989, Pages 298-312

  Sarkar, V ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--PROGRAM DIAGNOSTICS;

PROGRAM EXECUTION TIMES;

COMPUTER OPERATING SYSTEMS;

EID: 0024700878     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/74818.74845     Document Type: Article

References (26)

1. Frances Allen, Michael Burke, Philippe Charles, Ron Cytron, and Jeanne Ferrante. An overview of the ptran analysis system for multiprocessing. Proceedings of the 1987 International Conference on Supercomputing, 1987. Also published in The Journal of Parallel and Distributed Computing, Oct., 1988, Vol. 5, No. 5, pp. 617-640.
2. A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
3. Michael Burke. An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data Flow Analysis. Technical Report, IBM Research, August 1987. Research report RC12702, submitted to ACM Transactions on Programming Languages and Systems.
4. Ron Cytron and Jeanne Ferrante. An Improved Control Dependence Algorithm. Technical Report, IBM, 1987. Tech. Report RC 13291.
5. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method for computing static single assignment form. Sixteenth Annual ACM Symposium on Principles of Programming Languages, 25-35, January 1989.
6. Ron Cytron, Michael Hind, and Wilson Hsieh. Automatic generation of dag parallelism. Proceedings of the 1989 SIGPLAN Conference on Programming Language Design and Implementation, 1989. To appear.
7. W. P. Crowley, C. P. Hendrickson, and T. E. Rudy. The SIMPLE code. Technical Report, Lawrence Livermore Laboratory, 1978. UCID 17715.
8. John Cocke and Ken Kennedy. Profitability Computations on Program Flow Graphs. Technical Report, IBM, 1974. Tech. Report RC 5123.
9. J. A. Fisher, J. R. Ellis, J. C. Ruttenberg, and A. Nicolau. Parallel processing: a smart compiler and a dumb machine. Proceedings
10. of the ACM Symposium on Compiler Construction, 37 - 47, June 1984.
11. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 319-349, July 1987.
12. Philippe Flajolet and Jean-Marc Steyaert. A complexity calculus for recursive tree algorithms. Math. Systems Theory, 19:301-331, 1987.
13. Susan L. Graham, Peter B. Kessler, and Marshall K. McKusick. Gprof: a call graph execution profiler. ACM SIGPLAN ‘82 Symposium on Compiler Construction, 17(6):120-126, June 1982.
14. Timothy Hickey and Jacques Cohen. Automating program analysis. JACM, 35(1):185-220, 1988.
15. Wilson C. Hsieh. Extracting Parallelism from Sequential Programs. Technical Report, Massachusetts Institute of Technology, May 1988. Master's thesis.
16. D. E. Knuth. An empirical study of fortran programs. Software - Practice and Experience, 1:105-133, 1971.
17. Clyde Kruskal and Alan Weiss. Allocating independent subtasks on parallel processors. IEEE Transactions on Software Engineering, SE-11(10), October 1985.
18. F. H. McMahon. L.L.N.L. FORTRAN Kernels: MFLOPS. Technical Report, Lawrence Livermore National Laboratory, March 1986.
19. S. McFarling and J. Hennessy. Reducing the cost of branches. Proceedings of the Sigplan ‘86 Symposium on Compiler Construction, 21(7), July 1986.
20. Vivek Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. PhD thesis, Stanford University, April 1987. Tech. Report CSL-TR-87-328.
21. Vivek Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessors. Pitman, London and The MIT Press, Cambridge, Massachusetts, 1989. In the series, Research Monographs in Parallel and Distributed Computing.
22. V. Sarkar and J. Hennessy. Compile-time partitioning and scheduling of parallel programs. Proceedings of the Sigplan ‘86 Symposium on Compiler Construction, 21(7):17-26, July 1986.
23. V. Sarkar and J. Hennessy. Partitioning parallel programs for macro-dataflow. ACM Conference on Lisp and Functional Programming, 202-211, August 1986.
24. J. T. Schwartz and M. Sharir. A Design for Optimizations of the Bitvectoring Class. Technical Report, Courant Institute of Mathematical Sciences, New York University, September 1979. Courant Computer Science Report No. 17.
25. D. W. Wall. Global register allocation at link time. Proceedings of the Sigplan ‘86 Symposium on Compiler Construction, 21(7), July 1986.
26. Ben Wegbreit. Mechanical program analysis. CACM, 18(9):528-539, 1975.