Communication Performance Analysis of the NoCs in 2D and 3D Architectures

QIAN Yue1,LU Zhonghai2,DOU Qiang1,DOU Wenhua1

doi:10.3969/j.issn.1007130X.2011.

Computer Engineering & Science >

2011 , Vol. 33 >Issue 3: 34 - 40

DOI: https://doi.org/10.3969/j.issn.1007130X.2011.

论文

Communication Performance Analysis of the NoCs in 2D and 3D Architectures

Expand

（1.School of Computer Science,National University of Defense Technology,Changsha 410073,China;
2.Department of Electronics,Computer and Software Systems,
Royal Institute of Technology,Stockholm SE16440,Sweden）

Received date: 2009-10-20

Revised date: 2010-02-25

Online published: 2011-03-25

Fold

Abstract

Advanced integration technologies enable the construction of NetworkonChip (NoC) from two dimensions to three dimensions. Studies have shown that 3D NoCs can improve the average communication performance because of the possibility of using the additional dimension to shorten the communication distance. In this paper, we present a comparative analysis on the worstcase communication performance in the regular kary2mesh networks and their 3D forms. We show that, though 3D networks achieve better average latency, this may not be the case for the worstcase performance mainly due to the constraints on vertical channels. Our analysis is based on network calculus, which allows to calculate the theoretical delay bounds for constrained flows traversing network elements.

Key words： 3D NoC;network calculus;delay bound;performance analysis

Cite this article

QIAN Yue1,LU Zhonghai2,DOU Qiang1,DOU Wenhua1 . Communication Performance Analysis of the NoCs in 2D and 3D Architectures[J]. Computer Engineering & Science, 2011 , 33(3) : 34 -40 . DOI: 10.3969/j.issn.1007130X.2011.

References

［1］Pavlidis V,Friedman E. 3D Topologies for NetworksonChip［J］. IEEE Transactions on Very Large Scale Integration Systems, 2007,15(10):10811090.
［2］Loi,Mitra S, Lee T H, Fujita S, et al. A LowOverhead Fault Tolerance Scheme for TSVBased 3D Network on Chip Links［C］∥Proc of the 2008 IEEE/ACM Int’l Conf on ComputerAided Design, 2008:598602.
［3］Weerasekera R, Zheng LR, Pamunuwa D, et al. Extending SystemsonChip to the Third Dimension: Performance, Cost and Technological Tradeoffs［C］∥Proc of the 2007 IEEE/ACM Int’l Conf on ComputerAided Design, 2007:212219.
［4］Feero B,Pande P. NetworksonChip in a Three Dimensional Environment: A Performance Evaluation［J］. IEEE Transactions on Computers, 2008, 58(1):3245.
［5］Qian Y, Lu Z, Dou W. Analysis of Communication Delay Bounds for Network on Chips［C］∥Proc of the 14th Asia and South Pacific Design Automation Conf, 2009:712.
［6］Cruz R L. A Calculus for Network Delay, Part I: Network Elements in Isolation; Part II: Network Analysis［J］. IEEE Transactions on Information Theory, 1991, 37(1):114141.
［7］Chang CS. Performance Guarantees in Communication Networks［M］. Berlin:SpringerVerlag, 2000.
［8］Le Boudec JY,Thiran P. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet［M］. Berlin:SpringerVerlag, 2004.
［9］Stiliadis D,Varma A. LatencyRate Servers: A General Model for Analysis of Traffic Scheduling Algorithms［J］. IEEE/ACM Transactions on Networking, 1998, 6(5):611624.
［10］Lenzini L, Martorini L, Mingozzi E, et al. Tight EndtoEnd PerFlow Delay Bounds in FIFO Multiplexing SinkTree Networks［J］. Performance Evaluation, 2006, 63(910):956987.
［11］OMNeT++ Discete Event Simualtion System［EB/OL］.［20081015］.http://www.omnetpp.org/.

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article

References