loading...
Efficient Synthesis of Networks On Chip
San Jose, California October 13-October 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.2003.12408872003 IEEE International Conference on ...
 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 
 
Alessandro Pinto, Luca P. Carloni, Alberto L. Sangiovanni-Vincentelli, "Efficient Synthesis of Networks On Chip," Computer Design, International Conference on, pp. 146, 2003 IEEE International Conference on Computer Design (ICCD'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/ICCD.2003.1240887,
author = {Alessandro Pinto and Luca P. Carloni and Alberto L. Sangiovanni-Vincentelli},
title = {Efficient Synthesis of Networks On Chip},
journal ={Computer Design, International Conference on},
volume = {0},
year = {2003},
issn = {1063-6404},
pages = {146},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICCD.2003.1240887},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Design, International Conference on
TI - Efficient Synthesis of Networks On Chip
SN - 1063-6404
SP
EP
A1 - Alessandro Pinto,
A1 - Luca P. Carloni,
A1 - Alberto L. Sangiovanni-Vincentelli,
PY - 2003
KW - null
VL - 0
JA - Computer Design, International Conference on
ER -
 
Alessandro Pinto, University of California at Berkeley
Luca P. Carloni, University of California at Berkeley
Alberto L. Sangiovanni-Vincentelli, University of California at Berkeley
We propose an efficient heuristic for the constraint-driven communication synthesis (CDCS) of on-chip communication networks. The complexity of the synthesis problems comes from the number of constraints that have to be considered. In this paper we propose to cluster constraints to reduce the number that needs to be considered by the optimization algorithm. Then a quadratic programming approach is used to solve the communication synthesis problem with the clustered constraints. We provide an analytical model that justifies our choice of the clustering cost function and we discuss a set of experiments showing the effectiveness of the overall approach with respect to the exact algorithm.
Citation:
Alessandro Pinto, Luca P. Carloni, Alberto L. Sangiovanni-Vincentelli, "Efficient Synthesis of Networks On Chip," iccd, pp.146, 2003 IEEE International Conference on Computer Design (ICCD'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.