论文部分内容阅读
大规模并行处理机系统（ＭＰＰ）中路由算法对互联网络通信性能和系统性能起着重要作用．自适应路由算法具有灵活性好、网络的通道利用率高和网络容错能力强等优点，但其实现难度较大，因而目前仅在少数ＭＰＰ系统中得以实现．文中在ｍｅｓｈ结构上提出了一个低代价无死锁的完全自适应最短虫孔路由算法ＬＣＦＡＡ，该算法所需虚通道数少，具有代价低、自适应性强的特点．文中证明了算法的无死锁、无活锁性和完全自适应性，并模拟验证了其性能．
Routing algorithms in massively parallel processor systems (MPPs) play an important role in the performance of Internet communications and system performance. Adaptive routing algorithm has the advantages of good flexibility, high channel utilization of the network and strong network fault tolerance, but its implementation is more difficult and so far only achieved in a few MPP systems. In this paper, a completely self-adapting shortest worm hole routing algorithm LCFAA with no deadlock and low cost is proposed in the mesh structure, which requires fewer virtual channels and has the characteristics of low cost and high adaptability. This paper proves that the algorithm has no deadlock, no locking and completely adaptive, and its performance is verified by simulation.