首页> 外文期刊>Journal of Computers >Topology and Routing Algorithm Based on the Combination Gray Code with Johnson Code
【24h】

Topology and Routing Algorithm Based on the Combination Gray Code with Johnson Code

机译:基于Johnson代码的组合格雷码的拓扑和路由算法

获取原文
           

摘要

—Hypercubes utilizing Gray Code are used widely as the interconnection networks of parallel computer systems. But an n-dimensional hypercube has 2n nodes, when the size of a network have been increases added nodes must be 2i times more than its nodes and increase the degree of nodes , which affects scalable characteristic. The paper puts forward a scalable hypercube based on the Combination Gray Code with Johnson Code(GJCode(s, t)). The GJCode(s, t) has flexible scalable characteristics and the important properties of both Gray Code and Johnson Code which is there exists a link between two nodes only if their binary addresses differ in a single bit. In the GJCode(s, t), there are two adjustable parameters which offer a good tradeoff between the cost of networks and their performance in terms of the demand of application systems. The paper discusses the performance of several variations of the hypercube and proposes the routing algorithm for the GJCode(s, t), which can make packets pass along the shortest distance path and is very simple and easy to be implemented in hardware with low implementation cost. The GJCode(s, t) can be applied in parallel computer systems and networks on chip.
机译:- 利用格雷码的高压布被广泛用于并行计算机系统的互连网络。但是,N维超级机器具有2N节点,当网络的大小增加时,添加节点必须比其节点更多,并且增加节点的程度,影响可扩展特性。该文件基于与Johnson Code的组合格雷码(GJCODE(S,T))提出了可伸缩的超立闸。 GJCode(S,T)具有灵活的可扩展特性和格雷码和Johnson代码的重要属性,只有在其二进制地址在单个位不同时,才存在两个节点之间的链路。在GJCODE(S,T)中,有两个可调参数,在网络的需求和应用系统的需求方面提供了两个可调的参数,这些参数在网络的成本和它们的性能之间提供了良好的权衡。本文讨论了HyperCube几种变体的性能,并提出了GJCode(S,T)的路由算法,可以使数据包沿着最短距离路径传递,并且非常简单且易于在具有低实现成本的硬件中实现的。 GJCode(S,T)可以应用于并行计算机系统和芯片网络。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号