@COMMENT This file was generated by bib2html.pl version 0.94
@COMMENT written by Patrick Riley
@COMMENT None
@InProceedings{rian,
author = "Karthikeyan Sankaralingam and Vincent Ajay Singh and Stephen W. Keckler and Doug C. Burger",
title = "{Routed Inter-ALU Networks for ILP Scalability and Performance}",
pages = "170--177",
booktitle = "Proceedings of the 21st International Conference on Computer Design",
year = 2003,
month = {October},
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.
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.},
bib2html_dl_pdf = "http://www.cs.wisc.edu/~karu/docs/papers/utexas/iccd03-rian.pdf",
bib2html_pubtype = {Refereed Conference},
bib2html_rescat = {Architecture},
bib2html_extra_info = {This is a test of the extra info broadcasting system.}
}