Efficient deadlock-free routing

Project ID
FG-193
Project Categories
Computer Science
Completed
Abstract
Efficient deadlock-free routing strategies are crucial to the performance of large-scale computing systems. There are many methods but it remains a challenge to achieve lowest latency and highest bandwidth for irregular or unstructured high-performance networks. The lately published deadlick-free single-source-shortest-path routing algorithm is able to minimize the congestions in the network and is able to avoid deadlocks in the network traffic. We would like to install a patched version of the InfiniBand Open Subnet Manager on India to test the potential performace gain for users and their applications. The users of FG would benefit from the usage of this algorithm on the hpc systems, not only in terms of stability of the network, but also in terms of a speed-up of their MPI programs. The lowered runtime, on the one hand will reduce the costs per project and on the other hand will clear the space for more projects.
Use of FutureSystems
We would like to use one of the next maintenance windows to deploy our routing algorithm on india's infiniband to test and demonstrate its performance.
Scale of Use
As these tests involve changes to the core of the infiniband installation, India needs to be solely available to us during a maintenance for a couple of minutes up to 2h max to install, test and possibly roll back our changes to the InfiniBand Open Subnet Manager