Characterizing Traffic Locality in 3D NoC-Based CMPs Using a Path-Based Partitioning Method

The incorporation of the third dimension in the design of Networks-on-Chip (NoCs) provides a major performance improvement for Chip Multi-Processors (CMPs). Since multicast communication is necessary for parallelization, it is of significant importance to design routing methods that support multicast. The partitioning strategy has a major impact on the efficiency of the multicast routing method. The existing 3D partitioning methods are designed oblivious to the coherent traffic distribution in CMP networks. In this paper, we propose a novel partitioning method which is compatible with the locality of the traffic distribution across the network. By increasing the parallelism through eliminating the unnecessary long paths, a high performance structure is provided which is a valuable asset for CMPs. The experimental results indicate an average gain of 18% in performance and 4% in power consumption near the saturation points by exploiting the proposed partitioning strategy.

[1]  Hannu Tenhunen,et al.  Path-Based Partitioning Methods for 3D Networks-on-Chip with Minimal Adaptive Routing , 2014, IEEE Transactions on Computers.

[2]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[3]  Payman Zarkesh-Ha,et al.  Modeling NoC traffic locality and energy consumption with rent's communication probability distribution , 2010, SLIP '10.

[4]  Xiaola Lin,et al.  Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..

[5]  Luca Benini,et al.  Networks on Chips : A New SoC Paradigm , 2022 .

[6]  Jan M. Van Campenhout,et al.  Rent's rule and parallel programs: characterizing network traffic behavior , 2008, SLIP '08.

[7]  Axel Jantsch,et al.  Connection-oriented multicasting in wormhole-switched networks on chip , 2006, IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures (ISVLSI'06).

[8]  Natalie D. Enright Jerger,et al.  Virtual Circuit Tree Multicasting: A Case for On-Chip Hardware Multicast Support , 2008, 2008 International Symposium on Computer Architecture.

[9]  Ahmed Yassin Al-Dubai,et al.  A Performance Study of Path Based Multicast Communication Algorithms , 2006, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06).

[10]  Andrew B. Kahng,et al.  ORION 2.0: A Power-Area Simulator for Interconnection Networks , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Partha Pratim Pande,et al.  Networks-on-Chip in a Three-Dimensional Environment: A Performance Evaluation , 2009, IEEE Transactions on Computers.

[12]  Josep Torrellas,et al.  An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[13]  Xiaola Lin,et al.  Multicast Communication in Multicomputer Networks , 1993, ICPP.

[14]  Arvind Kumar,et al.  Three-dimensional integrated circuits , 2006, IBM J. Res. Dev..

[15]  Jeong-Gun Lee,et al.  Implications of Rent's Rule for NoC Design and Its Fault-Tolerance , 2007, First International Symposium on Networks-on-Chip (NOCS'07).

[16]  Ken Mai,et al.  The future of wires , 2001, Proc. IEEE.

[17]  Hong Xu,et al.  Unicast-Based Multicast Communication in Wormhole-Routed Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[18]  Dirk Stroobandt,et al.  The interpretation and application of Rent's rule , 2000, IEEE Trans. Very Large Scale Integr. Syst..