Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications of SPCL

P. Iff, M. Besta, M. Cavalcante, T. Fischer, L. Benini, T. Hoefler:

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

(In Proceedings of the 60th Annual Design Automation Conference, Jul. 2023)


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.


download article:
access preprint on arxiv:
download slides:

Recorded talk (best effort)



  author={Patrick Iff and Maciej Besta and Matheus Cavalcante and Tim Fischer and Luca Benini and Torsten Hoefler},
  title={{Sparse Hamming Graph: A Customizable Network-on-Chip Topology}},
  booktitle={Proceedings of the 60th Annual Design Automation Conference},