A novel analytical model for wormhole switching network on chip with adaptive routing

This paper proposes a novel analytical model for predicting average message latency under different traffic load in a network-on-chip where wormhole switching and fully adaptive routing protocols are used. The model has simple close-form calculations and yields extremely accurate results in the network stable regions. The validity of this model is shown by comparing analytical results with simulation results obtained on high-radix k-ary 2-cube networks.

[1]  Bruno Ciciani,et al.  An accurate model for the performance analysis of deterministic wormhole routing , 1997, Proceedings 11th International Parallel Processing Symposium.

[2]  Mohamed Ould-Khaoua,et al.  A Performance Model for Duato's Fully Adaptive Routing Algorithm in k-Ary n-Cubes , 1999, IEEE Trans. Computers.

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Radu Marculescu,et al.  System-Level Buffer Allocation for Application-Specific Networks-on-Chip Router Design , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

[6]  Sudhakar Yalamanchili,et al.  Interconnection Networks , 2011, Encyclopedia of Parallel Computing.

[7]  Pierre G. Paulin,et al.  System-on-chip beyond the nanometer wall , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[8]  Partha Pratim Pande,et al.  Performance evaluation and design trade-offs for network-on-chip interconnect architectures , 2005, IEEE Transactions on Computers.

[9]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[10]  Timothy Mark Pinkston,et al.  Characterization of Deadlocks in k-ary n-Cube Networks , 1999, IEEE Trans. Parallel Distributed Syst..