ACM Home Page
Please provide us with feedback. Feedback
Empirical evaluation of some features of instruction set processor architectures
Full text PdfPdf (1.10 MB)
Source
Communications of the ACM archive
Volume 20 ,  Issue 3  (March 1977) table of contents
Pages: 143 - 153  
Year of Publication: 1977
ISSN:0001-0782
Author
Åmund Lunde  Carnegie-Mellon Univ., Pittsburgh, PA, and Univ. i Oslo, Oslo, Norway
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 29,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/359436.359442
What is a DOI?

ABSTRACT

This paper presents methods for empirical evaluation of features of Instruction Set Processors (ISPs). ISP features are evaluated in terms of the time used or saved by having or not having the feature. The methods are based on analysis of traces of program executions. The concept of a register life is introduced, and used to answer questions like: How many registers are used simultaneously? How many would be sufficient all of the time? Most of the time? What would the overhead be if the number of registers were reduced? What are registers used for during their lives? The paper also discusses the problem of detecting desirable but non-existing instructions. Other problems are briefly discussed. Experimental results are presented, obtained by analyzing 41 programs running on the DECsystem10 ISP.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Alexander, W.G. How a programming language is used. Rep. CSRG-10, Comptr. Res. Group, U. of Toronto, Toronto, Canada, Feb. 1972.
 
2
Arbuckle, R.A. Computer analysis and thruput evaluation. Computers and Automation (Jan. 1966), 12-15 and 19.
 
3
 
4
Connors, W.D., Mercer, V.S., and Sorlini, T.A. S/360 instruction usage distribution. Rep. TR 00.2025, IBM Systems Development Div., Poughkeepsie, N.Y., May 8, 1970.
 
5
Foster, C.C., Gonter, R.H., and Riseman, E.M. Measures of opcode utilization. IEEE Trans. Computers C-20, 5 (May 1971), 582-584.
 
6
Foster, C.C., and Gonter, R.M. Conditional interpretation of operation codes. IEEE Trans. Computers C-20, 1 (Jan. 1971), 108-111.
 
7
Gibson, J.C. The Gibson mix. Rep. TR 00.2043, IBM Systems Development Div., Poughkeepsie, N. Y., 1970.
 
8
Gonter, R.H. Comparison of the Gibson mix with the UMASS mix. Pub. No. TN/RCC/004, Res. Comptg. Center, U. of Massachusetts, Amherst, Mass.
 
9
Herbst, E.H., Metropolis, N., and Wells, M.B. Analysis of problem codes on the MANIAC. Math. Tables and Other Aids to Comput. 9 (Jan. 1955), 14-20.
 
10
11
12
 
13
Tjaden, G.S., and Flynn, M.J. Detection and parallel execution of independent instructions. IEEE Trans. Computers C-19, 10 (Oct. 1970), 889-895.
 
14
Wilner, W.T. Design of the Burroughs B1700. Proc. AFIPS 1972 FJCC, Vol. 41, AFIPS Press, Montvale, N.J., pp. 489-497.
 
15
Wilner, W.T. Burroughs B1700 memory utilization. Proc. AFIPS 1972 FJCC, Vol. 41, AFIPS Press, Montvale, N.J., pp. 579-586.
 
16
Winder, R.O. Data base for computer performance evaluation. RCA-reprint PE-517, RCA David Sarnoff Res. Ctr., Princeton, N.J., 1971.
 
17
Winder, R.O. A data base for computer evaluation. Computer 6, 3 (March 1973), 25-29.
18

CITED BY  26