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)
Routed Inter-ALU Networks for ILP Scalability and Performance
San Jose, California
October 13-October 15
ISBN: 0-7695-2025-1
Karthikeyan Sankaralingam, The University of Texas at Austin
Vincent Ajay Singh, The University of Texas at Austin
Stephen W. Keckler, The University of Texas at Austin
Doug Burger, The University of Texas at Austin
Modern processors rely heavily on broadcast networks to bypass instruction results to dependent instructions in the pipeline. However, as clock rates increase, architectures get wider, and pipelines get deeper, broadcasting becomes more complex, slower, and more difficult to implement. This complexity is compounded by shrinking feature size, as the communication speed decreases relative to transistor switching speeds. This paper examines the fundamental needs of bypassing networks and proposes a method for classifying these Inter-ALU Networks based on how operands are routed from producers to consumers. We then propose and evaluate at both the circuit and architectural level a fine grain point-to-point Routed Inter-ALU Network (RIAN) that delivers the same or higher instruction throughput as a full bypass network but at higher speeds while using fewer wires.
Citation:
Karthikeyan Sankaralingam, Vincent Ajay Singh, Stephen W. Keckler, Doug Burger, "Routed Inter-ALU Networks for ILP Scalability and Performance," iccd, pp.170, 2003 IEEE International Conference on Computer Design (ICCD'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.