Maximum-Shortest-Path (MSP): An Optimal. Routimg Policy for Mesh-Connected Multicomputer

IEEE Transactions on Reliability

Volumn 48, Issue 3, 1999, Pages 247-255

  Wu, Jie ^a  

^a FLORIDA ATLANTIC UNIVERSITY   (United States)

Author keywords

Hypercube; Mesh; Mesh connected topology; Multicomputer; Shortest path routing; Torus

Indexed keywords

EID: 0000670148     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.799848     Document Type: Article

References (8)

1. R. Alversoii, D. Callahan, D. Cummings, et al, "The Tera Computer System", Technical Report, 1991; Tera Computer Company.
2. S. Badr, P. Poder, "An optimal shortest routing for network computers with regular mesh-connected topologies", IEEE Trans. Computers, vol 38, 1989 Oct, pp 1362 1371.
3. W.J. Dally, "The J-machine: System support for Actors", Actors: Know ledge-Based Concurrent Computing (Hewittfc Agha, Eds), 1989; MIT Press. ;
4. C. L. Seitz, et.al, "The architecture and programming of ! the Ametek Series 2010 multicomputer, Proc. Third ConJ. Hypercube Concurrent Computers and Applications, vol I, 1988 Jan, pp 33 - 36; ACM.
5. S.L. Lillevik, "The Touchstone 30 gigaflop DELTA prototype", Proc. 6th Distributed Memory Computing Conf, 1991, pp 671 - 677.
6. Y. Saad, M.H. Schultz, "Topological properties of hypercubes", IEEE Trans. Computers, vol 37, 1088 (7), Jul, pp > 867 - 872.
7. S. Scott, G. Thorson, "The Cray T3E network: Adaptive routing in high performance 3-torus, HOT Interconnects IV, 1991; Stanford Univ.•
8. T. Weller, B. Hajek, "Comments on: An optimal shortest1 path routing policy for network computers with regular mesh-connected topologies", IEEE Trans. Computers, vol 43, 1994 Jul, pp 862 - 864.