Diagonal and toroidal mesh networks

摘要: Diagonal and toroidal mesh are degree-4 point to interconnection models suitable for connecting communication elements in parallel computers, particularly multicomputers. The two networks have a similar structure. is popular well-studied whereas the diagonal relatively new. In this paper, we show that has smaller diameter larger bisection width. It also retains advantages such as simple rectangular structure, wirability scalability of network. An optimal self-routing algorithm developed these networks. Using existing routing mesh, simulated compare performance with N=35/spl times/71=2485, N=49/spl times/99=4851, N=69/spl times/139=9591 nodes under constant system fixed number messages. Deflection used resolve conflicts. effects various deflection criteria investigated. We outperforms all cases, thus provides an attractive alternative >