ACM Home Page
Please provide us with feedback. Feedback
Reducing the complexity of the issue logic
Full text PdfPdf (140 KB)
Source International Conference on Supercomputing archive
Proceedings of the 15th international conference on Supercomputing table of contents
Sorrento, Italy
Pages: 312 - 320  
Year of Publication: 2001
ISBN:1-58113-410-X
Authors
Ramon Canal  Departament d'Arquitectura de Computadors, Universitat Politécnica de Catalunya, Jordi Girona, 1-3 Mòdul D6
Antonio González  Departament d'Arquitectura de Computadors, Universitat Politécnica de Catalunya, Jordi Girona, 1-3 Mòdul D6
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 32,   Citation Count: 15
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/377792.377854
What is a DOI?

ABSTRACT

The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs that are much simpler than the traditional scheme while they retain most of its ability to exploit ILP. These alternative schemes are based on the observation that most values produced by a program are used by very few instructions, and the latencies of most operation are deterministic.


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
M.T. Bohr, "Interconnect Scaling - The Real Limiter to High Performance VLSI", in Proc. of the 1995 IEEE Int. Electron Devices Meeting, pp. 241-244, 1995.
 
2
D. Burger, T.M. Austin, S. Bennett, "Evaluating Future Microprocessors: The SimpleScalar Tool Set", Technical Report CS-TR-96-1308, University of Wisconsin-Madison, 1996.
 
3
R. Canal, J.M. Parcerisa, A. Gonzalez, "Dynamic Cluster Assignment Mechanisms", in Proc. of the 6th Int. Symp. on High-Performance Computer Arch., Toulouse, 2000, pp. 133-142.
4
5
 
6
 
7
D. Folegnani, A. Gonzalez, "Reducing Power Consumption of the Issue Logic", in the Workshop on Complexity-Effective Design, Vancouver, June 2000.
8
 
9
10
11
 
12
G.A.Kemp, M.Franklin, "PEWs: A Decentralized Dynamic Scheduler for ILP Processing", in Proc. of the Int. Conf. on Parallel Processing. 1996, v.1, pp 239-246.
13
 
14
 
15
 
16
17
 
18
 
19
Semiconductor Industry Association, "The National Technology Roadmap for Semiconductors", 1997.
 
20
J.E. Smith, G.S. Sohi, "The Mircoarchitecture of Superscalar Processors", in Proc. of the IEE, vol. 83, no. 12, december 1995, pp. 1609-1624.
21
 
22
R.M. Tomasulo, "An efficient algorithm for exploiting multiple arithmetic units", IBM Journal of Research and Development vol 11, pp 25-33, 1967.
23
 
24
D.W. Wall, "Limits of Instruction-Level Parallelism", Techincal Report WRL 93/6, Digital Western Research Lab, 1993.
 
25
S. Weiss, J.E.Smith, "Instruction Issue Logic in Pipelined Supercomputers", in the IEEE transactions on computers, vol. c-33, no.11, pp 1013-1022, November 1984.
 
26
 
27

CITED BY  15

Collaborative Colleagues:
Ramon Canal: colleagues
Antonio González: colleagues