|
[1] W. J. Dally and C. L. Seitz. Deadlock-free message routing in multi-processor interconnection networks. IEEE Transactions.on Computers,C-36(5):547-553,1987. [2] Rajendra V. Boppana and Suresh Chalasani. Fault-Tolerant Wormhole Routing Algorithm for Mesh Networks. IEEE Transactions on Computers. VOL. 44, NO.7,JULY 1995 [3] Younes M. Boura and Chita R. Das. Fault-tolerant Routing in Mesh Networks. 1995 International Conference on Parallel Processing. [4] A. A. Chien and J. H. Kim. Plannar-adaptive routing. Low-cost adaptive networks for multiprocessors. In Proc. 19th Ann. Int. Symp. on Computer Architecture, pages 268-277,1992. [5] Ran Libeskind-Hadas and Eli Brandt. Origin-Based fault-tolerant routing in the mesh. In Proc. First IEEE Symposium on High-Performance Computer Architecture,page 102-111,1995. [6] C.C.Su and K.G. Shin. Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes. IEEE transactions On Computers. 45,(6),June 1996,672-683 [7] Intel Corporation. A Touchstone DELTA System Description. 1991. [8] Jie Wu, Fault-tolerant Adaptive and Minimal Routing in Mesh-connected Multicomputers Using Extended Safety levels. in Proc. 1998 18th Int. Conf. On Distributed Computing Systems. 428-435. [9] Anjan K.V. and Timothy Mark Pinkston. An Efficient,Fully Adaptive Deadlock Recovery Scheme:DISHA. in the 22nd Ann. Int. Symp. On Computer Architecture.201-210,1995 [10] P. Lopez.,J.M. Martinez,J. Duato. A very Efficient Distributed Deadlock Detection Mechanism for wormhole Networks. In Proc. 1998 of 4th Int. Symp. on High Performance Computer Architecture. [11] J.M. Martinez,P. Lopez.,J. Duato. Impact of Buffer Size on the Efficiency of Deadlock Detection . In Proc. 1999 of 5th Int. Symp. on High Performance Computer Architecture. [12] J.Kim,Z. Liu, and A.Chien. Compressionless Routing: A Framework for Adaptive and Fault-tolerant Routing . in proc. Of the 21st Int. Symp. on Computer Architecture, IEEE Computer Society,pages 289-300, April 1994. [13] Douglas S. Reeves, Edward F. Gehinger, and Anil Chandirmani. Adaptive Routing and Deadlock Recovery:A Simulation Study. In Proc. of the 4th Conf. On Hypercube Concurrent Computers and Applications, March 1989. [14] D. H. Linder and J. C. Harden. An Adaptive and Fault-Tolerant Wormhole Routing Strategy for k-ary n-cubes. IEEE Transactions on Computers,40:2-12,1991. [15] P.H. Sui and S.D. Wang. An improved algorithm for foult-tolerant wormhole routing in meshes. IEEE Transactions. On Computers, 46(9):1040-1042. September 1997.
|