Static and Dynamic Characteristics of XPL Programs

@article{Alexander1975StaticAD,
  title={Static and Dynamic Characteristics of XPL Programs},
  author={William Alexander and David B. Wortman},
  journal={Computer},
  year={1975},
  volume={8},
  pages={41-46}
}
One use of performance measurement techniques is in the study of operational characteristics of programs written in high-level programming languages. Information derived from such studies can be used to construct benchmark programs and synthetic workloads,1,2detect inefficiencies in programming language implementation, and suggest possible improvements in the design of computers.3,9,10Our main interest is in the latter area: the discovery of primitive operations, implied by the semantics of a… 

More design data for stack architectures

TLDR
Some behavioural properties of programs running on a B6700 are presented, which have some interesting implications concerning the design of processors executing programs written in modern, high level languages.

Implications of structured programming for machine architecture

TLDR
A highly compact instruction encoding scheme is presented, which can reduce program size by a factor of 3.

Empirical analysis of the mesa instruction set

TLDR
Recent work to refine the instruction set of the Mesa processor is described, showing the results of this analysis as applied to a large sample of approximately 2.5 million instruction bytes.

The structure and performance of interpreters

TLDR
This paper examines interpreter performance by measuring and analyzing interpreters from both software and hardware perspectives and shows that interpreter performance is primarily a function of the interpreter itself and is relatively independent of the application being interpreted.

An instruction timing model of CPU performance

A model of high-performance computers is derived from instruction timing formulas, with compensation for pipeline and cache memory effects. The model is used to predict the performance of the IBM

An instruction timing model of CPU performance

A model of high-performance computers is derived from instruction timing formulas, with compensation for pipeline and cache memory effects. The model is used to predict the performance of the IBM

Using Peephole Optimization on Intermediate Code

TLDR
A table-driven peephole optimizer that improves this intermediate code suitable for algebraic languages and most byte-addressed mini- and microcomputers is described.

A static analysis of Pascal program structures

Analytical techniques, which have been derived from a compiler have been developed for the static analysis of Pascal programs. The results of studies on some user programs are presented which show

Automatic program analysis and evaluation

TLDR
An automatic data collection facility has been implemented as part of a PL/1 compiler at the University of Maryland and will evaluate some of the characteristics ofsome of the 25,000 programs that have been run since July, 1975.

Quantifying Behavioral Differences Between C and C++ Programs

TLDR
The results show that C++ programs exhibit behavior that is significantly different than C programs, which should be of interest to compiler writers and architecture designers who are designing systems to execute object-oriented programs.
...

References

SHOWING 1-10 OF 19 REFERENCES

Six PL/I compilers

TLDR
An experimental evaluation of the execution speed of object programs produced by six PL/I compilers and the relative speed of the object code produced by each compiler is described.

FETE: a Fortran execution time estimator

TLDR
FETE is a system of the former type which has two outstanding characteristics: it is very easy to implement and it isvery easy to use and should establish execution timing as a standard tool in program development.

An empirical study of FORTRAN programs

  • D. Knuth
  • Computer Science
    Softw. Pract. Exp.
  • 1971
TLDR
The principal conclusion which may be drawn is the importance of a program ‘profile’, namely a table of frequency counts which record how often each statement is performed in a typical run; there are strong indications that profile‐keeping should become a standard practice in all computer systems, for casual users as well as system programmers.

Measurement based automatic analysis of FORTRAN programs

TLDR
A valuable by-product of this measurement and analysis which directs attention toward those parts of a program which are leading candidates for application of optimization techniques is discussed, including an example of the automatic analysis of programs written in the FORTRAN IV language.

Language directed computer performance evaluation

TLDR
A new approach to the measurement and evaluation of computer performance that offers substantially reduced costs in performing benchmark evaluations and also provides a means for aggregating data from several benchmarks to produce one evaluation.

Conditional Interpretation of Operation Codes

A method, called conditional interpretation, is proposed which will allow small computers to have as large a set of instructions as may be desired without using a large number of bits to hold the

On the construction of a representative synthetic workload

TLDR
A general method of constructing a drive workload representative of a real workload is described, in which a synthetic program in which the characteristics can be varied by varying the appropriate parameters is used.