Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/8080
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Halavar, B. | |
dc.contributor.author | Talawar, B. | |
dc.date.accessioned | 2020-03-30T10:18:03Z | - |
dc.date.available | 2020-03-30T10:18:03Z | - |
dc.date.issued | 2018 | |
dc.identifier.citation | SPCOM 2018 - 12th International Conference on Signal Processing and Communications, 2018, Vol., , pp.282-286 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8080 | - |
dc.description.abstract | Network on Chips(NoC) emerged as the reliable communication framework in CMPs and SoCs which enables in increase the number and complexity of cores. Many 2-D NoC architectures have been proposed for efficient on-chip communication. Cycle accurate simulators model the functionality and behavior of NoCs by considering micro-architectural parameters of the underlined components to estimate performance metric. Using 3D IC technology in NoC can lead to improved communication latency and power compared to their 2D counterpart with use of through-silicon via (TSVs) as vertical interconnect. In this paper, we explore the design space of 3D variants of the Mesh and Butterfly Fat Tree(BFT) NoCs using floorplan driven wire and TSV lengths. Analysed the performance of 2D and 3D variants of the Mesh and BFT topologies by injecting uniform traffic pattern. Results of our experiments show that, average network latency of a 4-layer 3D Mesh shows better on-chip communication performance compare to other 3D variants. In 4-layer 3D Mesh, on-chip communication performance is improved up to 2.2� compare to 2D Mesh and 4.5� compare to 4-layer 3D BFT. � 2018 IEEE. | en_US |
dc.title | Floorplan based performance evaluation of 3d variants of mesh and BFT networks-on-chip | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.