Gaydadjiev; ”Assessing Fat-Tree topologies for Regular Network-on-Chip Design under Nanoscale Technology Constraints (2009)
| Venue: | Proc. of Design, Automation and Test in Europe (DATE |
| Citations: | 4 - 3 self |
BibTeX
@INPROCEEDINGS{Ludovici09gaydadjiev;”assessing,
author = {D. Ludovici and F. Gilabert and S. Medardoni and C. Gómez and M. E. Gómez and P. López and G. N. Gaydadjiev and D. Bertozzi},
title = {Gaydadjiev; ”Assessing Fat-Tree topologies for Regular Network-on-Chip Design under Nanoscale Technology Constraints},
booktitle = {Proc. of Design, Automation and Test in Europe (DATE},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most of past evaluations of fat-trees for on-chip interconnection networks rely on oversimplifying or even irrealistic architecture and traffic pattern assumptions, and very few layout analyses are available to relieve practical feasibility concerns in nanoscale technologies. This work aims at providing an in-depth assessment of physical synthesis efficiency of fat-trees and at extrapolating siliconaware performance figures to back-annotate in the system-level performance analysis. A 2D mesh is used as a reference architecture for comparison, and a 65 nm technology is targeted by our study. Finally, in an attempt to mitigate the implementation cost of k-ary n-tree topologies, we also review an alternative unidirectional multi-stage interconnection network which is able to simplify the fat-tree architecture and to minimally impact performance. 1.
