ACM Home Page
Please provide us with feedback. Feedback
Threaded multiple path execution
Full text PdfPdf (1.49 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 25th annual international symposium on Computer architecture table of contents
Barcelona, Spain
Pages: 238 - 249  
Year of Publication: 1998
ISBN:0-8186-8491-7
Also published in ...
Authors
Steven Wallace  Department of Computer Science and Engineering, University of California, San Diego
Brad Calder  Department of Computer Science and Engineering, University of California, San Diego
Dean M. Tullsen  Department of Computer Science and Engineering, University of California, San Diego
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): 9,   Downloads (12 Months): 23,   Citation Count: 31
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.279392
What is a DOI?

ABSTRACT

This paper presents Threaded Multi-Path Execution (TME), which exploits existing hardware on a Simultaneous Multi-threading (SMT) processor to speculatively execute multiple paths of execution. When there are fewer threads in an SMT processor than hardware contexts, threaded multi-path execution uses spare contexts to fetch and execute code along the less likely path of hard-to-predict branches.This paper describes the hardware mechanisms needed to enable an SMT processor to efficiently spawn speculative threads for threaded multi-path execution. The Mapping Synchronization Bus is described, which enables the spawning of these multiple paths. Policies are examined for deciding which branches to fork, and for managing competition between primary and alternate path threads for critical resources. Our results show that TME increases the single program performance of an SMT with eight thread contexts by 14%-23% on average, depending on the misprediction penalty for programs with a high misprediction rate.


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
B. Calder, D. Grunwald, and B. Zorn. Quantifying behavioral differences between C and C++ programs. Journal of Programming Languages, 2(4), 1994.
 
2
T.H. Heft and J.E. Smith. Selective dual path execution. Technical report, University of Wisconsin - Madison, November 1996. http://www, ece.wisc, edu/-jes/papers/sdpe, ps.
 
3
4
 
5
S. McFarling. Combining branch predictors. Technical Report TN-36, DEC-WRL, June 1993.
 
6
D.M. Tullsen. Simulation and modeling of a simultaneous multithreading processor. In 22nd Annual Computer Measurement Group Conference, December 1996.
7
8
 
9
G. Tyson, K. Lick, and M. Farrens. Limited dual path execution. Technical Report CSE-TR 346-97, University of Michigan, 1997.
 
10
 
11
S. Wallace, B. Calder, and D.M. Tullsen. Threaded multiple path execution. Technical Report CS97-551, University of California, San Diego, 1997.
 
12
13

CITED BY  31

Collaborative Colleagues:
Steven Wallace: colleagues
Brad Calder: colleagues
Dean M. Tullsen: colleagues