ACM Home Page
Please provide us with feedback. Feedback
Continual flow pipelines
Full text PdfPdf (274 KB)
Source Architectural Support for Programming Languages and Operating Systems archive
Proceedings of the 11th international conference on Architectural support for programming languages and operating systems table of contents
Boston, MA, USA
SESSION: Architecture table of contents
Pages: 107 - 119  
Year of Publication: 2004
ISBN:1-58113-804-0
Also published in ...
Authors
Srikanth T. Srinivasan  Intel Corporation
Ravi Rajwar  Intel Corporation
Haitham Akkary  Intel Corporation
Amit Gandhi  Intel Corporation
Mike Upton  Intel Corporation
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGOPS: ACM Special Interest Group on Operating Systems
SIGARCH: ACM Special Interest Group on Computer Architecture
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 32,   Downloads (12 Months): 157,   Citation Count: 30
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1024393.1024407
What is a DOI?

ABSTRACT

Increased integration in the form of multiple processor cores on a single die, relatively constant die sizes, shrinking power envelopes, and emerging applications create a new challenge for processor architects. How to build a processor that provides high single-thread performance and enables multiple of these to be placed on the same die for high throughput while dynamically adapting for future applications? Conventional approaches for high single-thread performance rely on large and complex cores to sustain a large instruction window for memory tolerance, making them unsuitable for multi-core chips. We present Continual Flow Pipelines (CFP) as a new non-blocking processor pipeline architecture that achieves the performance of a large instruction window without requiring cycle-critical structures such as the scheduler and register file to be large. We show that to achieve benefits of a large instruction window, inefficiencies in management of both the scheduler and register file must be addressed, and we propose a unified solution. The non-blocking property of CFP keeps key processor structures affecting cycle time and power (scheduler, register file), and die size (second level cache) small. The memory latency-tolerant CFP core allows multiple cores on a single die while outperforming current processor cores for single-thread applications.


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
6
7
 
8
 
9
A. Cristal, M. Valero, J.-L. Llosa, and A. Gonzalez. Large Virtual ROBs by Processor Checkpointing. Technical Report UPC-DAC-2002-39, Universitat Politecnica de Catalunya, July 2002.
10
11
 
12
G. Hinton, D. Sager, M. Upton, D. Boggs, D. Carmean, A. Kyker, and P. Roussel. The Microarchitecture of the Pentium 4 Processor. Intel Technology Journal, February 2001.
 
13
T. Karkhanis and J. E. Smith. A Day in the Life of a Data Cache Miss. In Workshop on Memory Performance Issues, June 2002.
14
 
15
 
16
T. Monreal, A. Gonzalez, M. Valero, J. Gonzalez, and V. Vinals. Dynamic Register Renaming Through Virtual-Physical Registers. In Journal of Instruction Level Parallelism, May 2000.
 
17
 
18
 
19
20
21
 
22
Y. Song and M. Dubois, Assisted Execution. University of Southern California, Technical Report #CENG 98-25, Department of EE-Systems, October 1998.
23

CITED BY  30
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Srikanth T. Srinivasan: colleagues
Ravi Rajwar: colleagues
Haitham Akkary: colleagues
Amit Gandhi: colleagues
Mike Upton: colleagues