ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Limits on multiple instruction issue
Full text PdfPdf (1.56 MB)
Source ACM SIGARCH Computer Architecture News archive
Volume 17 ,  Issue 2  (April 1989) table of contents
Special issue: Proceedings of ASPLOS-III: the third international conference on architecture support for programming languages and operating systems
Pages: 290 - 302  
Year of Publication: 1989
ISSN:0163-5964
Also published in ...
Authors
M. D. Smith  Center For Integrated Systems, Stanford University, Stanford, CA
M. Johnson  Center For Integrated Systems, Stanford University, Stanford, CA
M. A. Horowitz  Center For Integrated Systems, Stanford University, Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 45,   Citation Count: 51
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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/68182.68209
What is a DOI?

ABSTRACT

This paper investigates the limitations on designing a processor which can sustain an execution rate of greater than one instruction per cycle on highly-optimized, non-scientific applications. We have used trace-driven simulations to determine that these applications contain enough instruction independence to sustain an instruction rate of about two instructions per cycle. In a straightforward implementation, cost considerations argue strongly against decoding more than two instructions in one cycle. Given this constraint, the efficiency in instruction fetching rather than the complexity of the execution hardware limits the concurrency attainable at the instruction level.


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.

 
Acos 86
 
Aho 86
 
Apol 88
Apollo Computer Inc. Marketing Brochure. The series 10000 Personal Supercomputer. Chelmsford. MA, 1988.
 
Fost 72
C.C. Foster and E.M. Riseman, "Percolation of Code to Enhance Parallel Dispatching and Execution IEEE Transactions on. Computers, Vol. C-21 (December 1972), pp. 1411-1415.
 
Henn 86
J.L. Hennessy, "RISC-Based Processors: Concepts and Prospects". New Froniiers in Corn p,ler Architecture Conference Proceedings (hlarch 1986), pp. 95- 103.
Kell 75
 
Kuck 72
D.J. Kuck. Y. Muraol,'a, and S. C. hen, "On the Number of Opera. Lions Simultaneously Executable in Fortran-like Programs and Their resulting Speedup". IEEE Transaciions on computers, Vol. C-21 (December 1972), pp. 1293--1310.
 
Lee 84
J.K.F. Lee and A.J. Smith, "Branch Prediction Strategies and Branch Target Buffer Design" IEEE Computer (January 1984). pp. 6-22.
 
Logr 72
L. Logrippo. "Renamillg in Program Schemas". Proceedings of the IEEE 13th Annual Symposium on switching and Automata Theory. (October 1972), Pp. 67- 70.
McFa 86
 
MIPS 86
MIPS Computer Systems, Inc., MIPS Language Programmers Guide (1986).
 
Nico 84
A. Nicolau and J.A. Fisher, "Mea.suring tile Parallelism Availa.ble for Very Long Instruction Word Architectures". IEEE Transactions on Computers. vol. C-33 (November 1984), pp. 968-976.
 
Rise 72
E.hl. Riselnan and C.C. Foster, "The Inhibition of Potential Parallelism by Conditional Pumps". IEEE Transactions on Computers, Vol. C-21 (December 1972), pp. 1405-1411.
 
Slav 88
G.A. Slaxenburg, Phillips Research Laboratories Sunnyvale, Signetics Corporation, Sunnyvale, CA. Personal Correspondence, 12 May 1988.
Smit 87
Sohi 87
 
Tjad 70
G.S. Tjaden and M.J. Flynn, "Detection and Parallel Execution of Independent. Instructions". IEEE Transacactions on Computers, Vol. C-19 (October 1970), pp. 889-895.
 
Toma 67
R.M. Tomasulo, "An Efficient Algorithm for Exploiting Multiple Arithmetic Units'. IBM Journal, Vol. 11 (January 1967), pp. 25-33.
 
Weis 84
S. Weiss and J.E. Smith, "Instrtlction Issue Logic in Pipelined Supercomputers". IEEE Transaction"s on Computer's, Vol. C-33 (November 1984), pp. 1013-1022.

CITED BY  51

Collaborative Colleagues:
M. D. Smith: colleagues
M. Johnson: colleagues
M. A. Horowitz: colleagues