A general theory for deadlock-free adaptive routing using a mixed set of resources

IEEE Transactions on Parallel and Distributed Systems

Volumn 12, Issue 12, 2001, Pages 1219-1235

  Duato, José ^a,b   Pinkston, Timothy Mark ^a,c  

^a IEEE   (Spain)

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

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

General theory for deadlock free fully adaptive routing; Irregular networks; Nonatomic queue allocation; Regular networks

Indexed keywords

ADAPTIVE ROUTING ALGORITHMS; IRREGULAR NETWORKS; NETWORK ROUTERS; NETWORK TOPOLOGIES; NONATOMIC QUEUE ALLOCATION; REGULAR NETWORKS;

ADAPTIVE ALGORITHMS; INTERCONNECTION NETWORKS; QUEUEING NETWORKS; RESOURCE ALLOCATION; ROUTERS;

PARALLEL PROCESSING SYSTEMS;

EID: 0035695821     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.970556     Document Type: Article

References (57)

1. The SP2 high-performance switch
2. The Cray T3E network: Adaptive routing in a high performance 3D torus
3. The SGI origin: A ccNUMA highly scalable server
4. Autonet: A high-speed, self-configuring local area network using point-to-point links
5. Myrinet-a gigabit per second local area network
6. ServerNet II
7. Deadlock-free message routing in multiprocessor interconnection networks
8. Virtual cut-through: A new computer communication switching technique
9. ServerNet deadlock avoidance and fractahedral topologies
10. Cavallino: The teraflops router and NIC
11. Spider: A high speed network interconnect
12. The impact of pipelined channels on k-ary n-cube networks
13. Virtual channel flow control
14. Efficient adaptive routing in networks of workstations with irregular topology
15. On the use of virtual channels in networks of workstations with irregular topology
16. Chaos router: Architecture and performance
17. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
18. Deadlock-free adaptive routing in multicomputer networks using virtual channels
19. A new theory of deadlock-free adaptive routing in wormhole networks
20. Compressionless routing: A framework for adaptive and fault-tolerant routing
21. An efficient, fully adaptive deadlock recovery scheme: DISHA
22. Virtual cut-through implementation of the hole-based packet switching routing algorithm
23. Architecture and implementation of the reliable router
24. Architecture and optoelectronic implementation of the WARRP router
25. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
26. Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha concurrent
27. Flexible and efficient routing based on progressive deadlock recovery
28. Optimized routing in the Cray T3D
29. A delay model for router microarchitectures
30. Characterization of deadlocks in irregular networks
31. Characterization of deadlocks in k-ary n-cube networks
32. A very efficient distributed deadlock detection mechanism for wormhole networks
33. On deadlocks in interconnection networks
34. Software based deadlock recovery for true fully adaptive routing in wormhole networks
35. Dynamically-allocated multi-queue buffers for VLSI communication switches
36. A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks
37. A formal model of message blocking and deadlock resolution in interconnection networks
38. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
39. Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery
40. DISHA: A deadlock recovery scheme for fully adaptive routing
41. Multicast communication in multicomputer networks
42. Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks: Algorithms and simulations
43. The message flow model for routing in wormhole-routed networks
44. A universal proof technique for deadlock-free routing in interconnection networks
45. A necessary and sufficient condition for deadlock-free wormhole routing
46. A deadlock avoidance method for computer networks
47. Adaptive routing in irregular networks using cut-through switches
48. Deadlock avoidance in store-and-forward networks-I: Store-and-forward deadlock
49. Prevention of deadlocks in packet-switched data transport systems
50. A general theory for deadlock avoidance in wormhole-routed networks
51. A family of fault-tolerant routing protocols for direct multiprocessor networks
52. High performance communications in processor networks
53. Adaptive routing and deadlock recovery: A simulation study
54. Compressionless routing: A framework for adaptive and fault-tolerant routing
55. An adaptive deadlock and livelock free routing algorithm
56. A flow control mechanism to prevent message deadlock in k-ary n-cube networks