The reviewed record of science sign in
Pith

arxiv: 2211.13980 · v4 · pith:PAFMHH23 · submitted 2022-11-25 · cs.AR · cs.DC· cs.NI

Sparse Hamming Graph: A Customizable Network-on-Chip Topology

Reviewed by Pithpith:PAFMHH23open to challenge →

classification cs.AR cs.DCcs.NI
keywords topologychipscostdesigngraphhammingperformancesparse
0
0 comments X
read the original abstract

Chips with hundreds to thousands of cores require scalable networks-on-chip (NoCs). Customization of the NoC topology is necessary to reach the diverse design goals of different chips. We introduce sparse Hamming graph, a novel NoC topology with an adjustable costperformance trade-off that is based on four NoC topology design principles we identified. To efficiently customize this topology, we develop a toolchain that leverages approximate floorplanning and link routing to deliver fast and accurate cost and performance predictions. We demonstrate how to use our methodology to achieve desired cost-performance trade-offs while outperforming established topologies in cost, performance, or both.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.