Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Computer networks
IEEE Transactions on Software Engineering
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Tiny: an efficient routing harness for the Inmos transputer
Concurrency: Practice and Experience
Design, implementation and evaluation of a deadlock-free routing algorithm for concurrent computers
Concurrency: Practice and Experience
A new distributed route selection approach for channel establishment in real-time networks
IEEE/ACM Transactions on Networking (TON)
ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
High-level directives to drive the allocation of parallel object-oriented applications
HIPS '97 Proceedings of the 1997 Workshop on High-Level Programming Models and Supportive Environments (HIPS '97)
| Hi-index | 0.00 |
The paper presents two adaptive routing algorithms supporting communications in massively parallel architectures where the allocation of processes to nodes is unknown. This situation is typical of dynamic environments where processes may be created and terminated dynamically or can move from one node to another according to load balancing requirements. One of the properties of these algorithms is the ability to limit the number of hops in the source-destination path by reducing the occurrence of loops in it, so as to achieve a better response time. Other properties are the complete independence of the network topology and the use of neighborhood information in the choice of the output link for the message. Deadlock freedom is ensured by the adoption of a deadlock prevention method. The paper shows the performance figures of the two adaptive routing algorithms implemented for one massively parallel architecture.