Deadlock-free routing in irregular networks with dynamic reconfiguration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1602, Issue , 1999, Pages 165-180

  Casado, Rafael ^a   Quiles, Francisco J ^a   Sánchez, José L ^a   Duato, José ^b  

^a UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AVAILABILITY; DYNAMIC MODELS; MEMORY ARCHITECTURE; NETWORK ARCHITECTURE; PARALLEL ARCHITECTURES; TOPOLOGY;

DEADLOCK-FREE ROUTING; DISTRIBUTED APPLICATIONS; DISTRIBUTED RECONFIGURATION; DYNAMIC RE-CONFIGURATION; DYNAMIC RECONFIGURATION ALGORITHMS; NETWORK RE-CONFIGURATION; RECONFIGURATION PROCESS; SYSTEM AVAILABILITY;

LOCAL AREA NETWORKS;

EID: 84947940673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10704826_12     Document Type: Conference Paper

References (19)

1. Schroeder M.D. et al.: Autonet: A high-speed, selfconfiguring local area network using point-to-point links. IEEE Journal on Selected Areas in Communications, vol. 9. No 8. October 1991.
2. Felderman R. E., et al.: Atomic: A High Speed Local Communication Architecture. J. High Speed Networks, vol. 3, no 1, pp. 1-29, 1994.
3. Boden N. et al.: Myrinet: A gigabit per second LAN. IEEE Micro. February 1995.
4. Horst R.W.: Tnet: A reliable system area network. IEEE Micro. February 1995.
5. Rodeheffer T. L., Schroeder M. D.: Automatic Reconfiguration in Autonet. SRC Research Report 77. September 18, 1991.
6. Owicki S. S., Karlin A. R.: Factors in the performance of AN1 Computer Network. SRC Research Report 88. June, 1992.
7. Knightly E. W., Zhang H.: D-BIND: An accurate traffic model for providing QoS guarantees to VBR traffic. IEEE Trans. on Networking, vol. 5, no 2. April, 1995.
8. Pfister G. F.: In search of clusters. Prentice Hall, Englewood, NJ 1995.
9. Pakin S., Lauria M., Chien A.: High performance messaging on workstations: Illinois fast messages on Myrinet. Supercomputing 95. November 1995.
10. Casado R., Caminero M. B., Cuenca P., Quiles F. J., Garrido A., Duato J.: A tool for the analysis of reconfiguration and routing algorithms in irregular networks. Lecture Notes in Computer Science, vol. 1362. pp. 159-173. Proc. of the CANPC'98. USA. February 1998.
11. Qiao W., Ni L. M.: Adaptive routing in irregular networks using cut-through switches. In proceedings of the 1996 International Conference on Parallel Processing, August 1996.
12. Silla F., Malumbres M. P., Robles A., López P., Duato J.: Efficient Adaptive Routing in Networks of Workstations with Irregular Topology. Workshop on Communications and Architectural Support for Network-based Parallel Computing. February 1997.
13. Silla F. Duato J.: Improving the efficiency of adaptive routing in networks with irregular topology. International Conference on High Performance Computing. December 1997.
14. Abali B.: A Deadlock Avoidance Method for Computer Networks. Proc. of the CANPC'97. USA. February 1997.
15. Dally W.J., Seitz C.L.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, vol. C-36, no. 5. May 1987.
16. Perlman R.: An algorithm for distributed computation on a spanning tree in a extended LAN. Ninth Data Common Symp. Whistler Mountain. British Columbia. Sept.10-13. 1985. pp. 44-53.
17. Casado R., Quiles F.J., Sánchez J. L., and Duato J.: An Efficient Protocol for Dynamic Reconfiguration in Irregular Networks. Technical Report. TR-DI1-UCLM98.
18. http://raap.info-ab.uclm.es/public/techreports/techs.htm
19. Duato J.: A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331. December 1993.