ACM Home Page
Please provide us with feedback. Feedback
Selective eager execution on the PolyPath architecture
Full text PdfPdf (1.57 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 25th annual international symposium on Computer architecture table of contents
Barcelona, Spain
Pages: 250 - 259  
Year of Publication: 1998
ISBN:0-8186-8491-7
Also published in ...
Authors
Artur Klauser  University of Colorado, Department of Computer Science, Boulder, CO
Abhijit Paithankar  University of Colorado, Department of Computer Science, Boulder, CO
Dirk Grunwald  University of Colorado, Department of Computer Science, Boulder, CO
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 25
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Control-flow misprediction penalties are a major impediment to high performance in wide-issue superscalar processors. In this paper we present Selective Eager Execution (SEE), an execution model to overcome mis-speculation penalties by executing both paths after diffident branches. We present the micro-architecture of the PolyPath processor, which is an extension of an aggressive superscalar, out-of-order architecture. The PolyPath architecture uses a novel instruction tagging and register renaming mechanism to execute instructions from multiple paths simultaneously in the same processor pipeline, while retaining maximum resource availability for single-path code sequences.Results of our execution-driven, pipeline-level simulations show that SEE can improve performance by as much as 36% for the go benchmark, and an average of 14% on SPECint95, when compared to a normal superscalar, out-of-order, speculative execution, monopath processor. Moreover, our architectural model is both elegant and practical to implement, using a small amount of additional state and control logic.


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
 
2
 
3
4
 
5
Timothy Heil and James Smith. Selective Dual Path Execution. Technical report, University of Wisconsin-Madison, November 1996. http://w ww.ece, wi sc.edu/j es/papers/sdpe, ps.
 
6
 
7
8
 
9
 
10
Kelsey Lick. Limited Dual Path Execution. Master's thesis, University of California, Riverside, 1996.
 
11
 
12
Scott McFarling. Combining Branch Predictors. TN 36, DEC-WRL, June 1993.
 
13
Abhijit Paithankar. AINT: A Tool for Simulation of Shared- Memory Multiprocessors. Master's thesis, University of Colorado at Boulder, 1996.
 
14
 
15
Digital Semiconductor. Alpha AXP-21164 Processor Hardware Reference Manual, September 1997.
16
 
17
18
 
19
 
20
Gary Tyson, Kelsey Lick, and Matthew Farrens. Limited Dual Path Execution. CSE-TR 346-97, University of Michigan, 1997.
 
21
 
22
23

CITED BY  25

Collaborative Colleagues:
Artur Klauser: colleagues
Abhijit Paithankar: colleagues
Dirk Grunwald: colleagues