loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 IEEE International Conference on Computer Design (ICCD'03)
Reducing Operand Transport Complexity of Superscalar Processors using Distributed Register Files
San Jose, California
October 13-October 15
ISBN: 0-7695-2025-1
Santithorn Bunchua, Georgia Institute of Technology, Atlanta
D. Scott Wills, Georgia Institute of Technology, Atlanta
Linda M. Wills, Georgia Institute of Technology, Atlanta
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed register file architecture that employs fully distributed functional unit clusters is presented. It utilizes a local register mapping table and a dedicated register transfer network to support distributed register operations. In addition, an eager transfer mechanism is developed to reduce penalties caused by incomplete operand transport interconnection. Distributed register files can be employed to reduce operand access time by a factor of two with associated average IPC penalties of 14% and 21% on 4- and 8-way superscalar architectures across a broad range of symbolic, scientific, and multimedia applications. The IPC penalties are only 3% and 10% for SpecINT 2000 applications.
Citation:
Santithorn Bunchua, D. Scott Wills, Linda M. Wills, "Reducing Operand Transport Complexity of Superscalar Processors using Distributed Register Files," iccd, pp.532, 2003 IEEE International Conference on Computer Design (ICCD'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.