摘要
1 概述大规模并行处理系统中各计算结点均依靠机间互联网进行通讯和协调。影响网络通讯性能的因素主要有拓扑结构、流控策略和路由算法等。目前针对互联网的研究工作主要集中于k-ary n-cube这样一类规则互联网。网络有n维,每维上有k个结点,每维上第i(i∈[0,k—2])与第i+1个结点间有通道连接。当每维上第k—1与第0个结点间没有绕边(wrap-around)通道连接,该网络就是k-ary n-mesh。
Most deadlock-free adaptive routing algorithms are based on virtual channels. Virtual channel increases the network throughput,and makes it easier to solve the deadlock problem. Nevertheless virtual channel makes the router more complex,and increases the setup latency. According to Chien's model, PAM routing algorithm,which has no virtual,deadlock-free and partial adaptive,is introduced base on k-ary n-mesh. Compared to the routing algorithms DOR (Dimension Ordered) and PAR (Planar Adaptive),the results show that PAM has the better performance.
出处
《计算机科学》
CSCD
北大核心
2000年第3期70-73,共4页
Computer Science
关键词
路由算法
虚通道
路由器
互联网
Virtual channel,PAM routing algorithm,k-ary n-mesh,Router model,Setup latency
