2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) (1995)
Raleigh, North Carolina
Jan. 22, 1995 to Jan. 25, 1995
C.M. Cunningham , Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
D.R. Avresky , Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
Many massively parallel computers in use today utilize simple deterministic XY wormhole routing to transmit messages between nodes. Because XY routing does not provide any routing adaptability, it lacks the ability to avoid congested links, as well as faults. Therefore, the focus of this paper will be two-fold: improving the performance of wormhole routing and providing fault tolerance for up to N-1 faults in an N/spl times/N two-dimensional mesh. A simulation model based on the Intel Paragon is presented that compares several known routing strategies with the proposed strategy to illustrate how local state information can be used to provide a potential network throughput improvement of up to 20%, while achieving fault tolerance.
multiprocessor interconnection networks; fault tolerant computing; network routing; adaptive routing; two-dimensional meshes; fault tolerance; routing strategies; Intel Paragon; deterministic XY wormhole routing; XY routing; routing adaptability
C.M. Cunningham, D.R. Avresky, "Fault-tolerant adaptive routing for two-dimensional meshes", 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA), vol. 00, no. , pp. 122, 1995, doi:10.1109/HPCA.1995.386549