Research on  a  2DMeshBased NetworkOnChip Routing Algorithm

J4 ›› 2011, Vol. 33 ›› Issue (5): 32-37.

• 论文 • Previous Articles Next Articles

Research on a 2DMeshBased NetworkOnChip Routing Algorithm

SHI Shuai，DOU Wenhua，LU Jia

(National Laboratory for Parallel and Distributed Processing,Changsha 410073,China)

Received:2010-08-05 Revised:2010-10-29 Online:2011-05-25 Published:2011-05-25

Abstract

Abstract:

Networkonchip and network coding both are quickly developed research fields in recent years.NOC will play an important role in the VLSI field. Network coding has an incomparable advantage compared to other methods in improving the network throughput and network load balancing has.This article uses the main idea of network coding in 2DMesh NOC to do some exploratory research,and proposes a framework routing strategy based on the 2DMesh structure.The conclusion demonstrates that this strategy has good compatibility, and will bring a good performance improvement in multicast applications,and this framework routing strategy has strong portability and can be deployed in other structures of NOC.

Key words: networkonchip；network coding；2DMesh

SHI Shuai，DOU Wenhua，LU Jia. Research on a 2DMeshBased NetworkOnChip Routing Algorithm[J]. J4, 2011, 33(5): 32-37.

References

［1］Sullivan H,Bashkow T R. A Large Scale,Homogeneous, Fully Distributed Parallel Machine［C］∥Proc of the 4th Annual Symp on Computer Architecture, 1977:105117.
［2］Valiant L G,Brebner G J. Universal Schemes Forparallel Communication［C］∥Proc of the Thirteenth Annual ACM Symp on Theory of Computing, 1981:263277.
［3］Nesson T,Johnsson S L. Romm Routing on Mesh and Torus Networks［C］∥Proc of the Seventh Annual ACM Symp on Parallel Algorithms and Architectures, 1995:275287.
［4］Upadhyay J, Varavithya V, Mohapatra P. A Traffic Balanced Adaptive Wormhole Routing Scheme for TwoDimensional Meshes［J］. IEEE Trans on Computers, 1997,46(2):190197.
［5］Jiang Nan,Kim J,Dally W J.Indirect Adaptive Routing on Large Scale Interconnection Networks［C］∥Proc of ISCA’09, 2009:220231.
［6］Ahlswede R，Cai N,Li S Y R，et al．Network Information Flow［J］．IEEE Trans on Information Theory，2000，46(4)：12041216.
［7］Ramanathan S． Multicast Tree Generation Networks with Asymmetric Links［J］.IEEE／ACM Trans on Networking,1996,4(4)：558568.
［8］Charikar M,Chekuri C,Cheung Toyat.Approximation Algorithms for Directed Steiner Problems［C］∥Proc of 1998 Ninth AnnuaI ACMSIAM Symp on Discrete Algorithms,1998:192200.
［9］Zosin L，KhulIer S．On Directed Steiner Trees［C］∥Proc of the 13th Annual ACMSIAM Symp on Discrete Algorithms(SODA 2002),2002:5963.
［10］Kim J, Balfour J, Dally W.Flattened Butterfly Topology for on Chip Networks［C］∥Proc of the 40th Annual IEEE/ACM Int’l Symp on Micro Architecture,2007:172182.
［11］Balfour J,Dally W J.Design Tradeoffs for Tiled CMP Onchip Networks［C］∥Proc of the 20th Annual Int’l Conf on Supercomputing, 2006:187198.
［12］Das R, Eachempati S, Mishra A K, et al.Design and Evaluation of a Hierarchical OnChip Interconnect for NextGeneration CMPs［C］∥Proc of Int’l Symp on HighPerformance Computer Architecture,2009:175186.
［13］卢开澄，卢华明.图论及其应用［M］.第二版.北京：清华大学出版社,1995.
［14］Seo D, Ali A,Lim WT,et al.NearOptimal WorstCase Throughput Routing for TwoDimensional Mesh Networks［C］∥Proc of the 32nd Annual Int’l Symp on Computer Architecture, 2005:432443.
师帅(1986),男,陕西乾县人，硕士生，研究方向为计算机网络。Email:s.s.craig@163.com
SHI Shuai,born in 1986,MS candidate,his research interest includes computer network.

Research on a 2DMeshBased NetworkOnChip Routing Algorithm

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics

Comments