loading...
Routing-Tree Construction with Concurrent Performance, Power and Congestion Optimization
Karlsruhe, Germany March 02-March 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVLSI.2006.80IEEE Computer Society Annual Symposiu ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Cengiz Alkan, Tom Chen, "Routing-Tree Construction with Concurrent Performance, Power and Congestion Optimization," VLSI, IEEE Computer Society Annual Symposium on, pp. 367-372, IEEE Computer Society Annual Symposium on VLSI: Emerging VLSI Technologies and Architectures (ISVLSI'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ISVLSI.2006.80,
author = {Cengiz Alkan and Tom Chen},
title = {Routing-Tree Construction with Concurrent Performance, Power and Congestion Optimization},
journal ={VLSI, IEEE Computer Society Annual Symposium on},
volume = {0},
year = {2006},
isbn = {0-7695-2533-4},
pages = {367-372},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISVLSI.2006.80},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - VLSI, IEEE Computer Society Annual Symposium on
TI - Routing-Tree Construction with Concurrent Performance, Power and Congestion Optimization
SN - 0-7695-2533-4
SP367
EP372
A1 - Cengiz Alkan,
A1 - Tom Chen,
PY - 2006
KW - null
VL - 0
JA - VLSI, IEEE Computer Society Annual Symposium on
ER -
 
Cengiz Alkan, Colorado State University, Fort Collins
Tom Chen, Colorado State University, Fort Collins
We present a routing-tree construction algorithm that considers multi-objectives of performance, power and congestion concurrently. Congestion is measured with balanced usage of routing resources among layers. Simultaneous buffer insertion and layer assignment tends to produce routing-trees with shorter overall length. Applying the proposed simultaneous algorithm on a subset of routes on a commercial 64-bit microprocessor yielded 9% less repeater usage and 1.5% shorter overall routingtree length with improved overall performance at the same time, compared to sequential routing-tree construction approach.
Citation:
Cengiz Alkan, Tom Chen, "Routing-Tree Construction with Concurrent Performance, Power and Congestion Optimization," isvlsi, pp.367-372, IEEE Computer Society Annual Symposium on VLSI: Emerging VLSI Technologies and Architectures (ISVLSI'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.