• DocumentCode
    2220346
  • Title

    Routed inter-ALU networks for ILP scalability and performance

  • Author

    Sankaralingam, Karthikeyan ; Singh, Vincent Ajay ; Keckler, Stephen W. ; Burger, Doug

  • Author_Institution
    Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
  • fYear
    2003
  • fDate
    13-15 Oct. 2003
  • Firstpage
    170
  • Lastpage
    177
  • Abstract
    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. We examine the fundamental needs of bypassing networks and propose 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.
  • Keywords
    communication complexity; computer networks; pipeline processing; telecommunication network routing; broadcast network; bypassing network; clock rate; pipelined processor; routed inter-ALU network; transistor switching speed; Broadcast technology; Broadcasting; Clocks; Computer architecture; Delay; Dynamic scheduling; Pipelines; Processor scheduling; Scalability; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Design, 2003. Proceedings. 21st International Conference on
  • ISSN
    1063-6404
  • Print_ISBN
    0-7695-2025-1
  • Type

    conf

  • DOI
    10.1109/ICCD.2003.1240891
  • Filename
    1240891