摘要： 该文将给出一个超树,即m-fold n-ary tree的定义。由于在其上实现虫孔通信时有不同于其它拓扑结构的一些独特的性质,因而具有较低的传输延迟,较高的吞吐量和性能价格比。文章将结合一种具体的路由算法来说明它的这些特性,并通过计算机模拟给出这种处理器互连网和mesh拓扑结构在进行消息传输时的比较结果。

关键词: 处理器互连网, m-foldn－arytree, 虫孔通信, 自适应性

Abstract: This paper provides a definition of a kind of hypertree, ie the m-fold n-ary tree. It has some properties different from that of some other common topologies. For example, when applying wormhole routing mechanism on it, we can easily implement adaptive, deadlock and livelock free routing algorithms with some tolerace ability. The results of these properties are the lower latency, higher throughput and higher performance cost ratio. In this paper, we will demonstrate these properties using a specific routing algorithm. A simulating comparison result between m-folo y tree and mesh topology is also given.

中图分类号: 

• TP393.03