Routing problem in rectangular mesh network using shortest path based Greedy method

• Main Authors: Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad
• Format: Conference or Workshop Item
• Language: English
• Published: IOP Publishing 2019
• Subjects: QA Mathematics; QA76 Computer software
• Online Access: http://umpir.ump.edu.my/id/eprint/27917/1/Routing%20problem%20in%20rectangular%20mesh%20network%20using%20shortest.pdf; http://umpir.ump.edu.my/id/eprint/27917/; https://doi.org/10.1088/1742-6596/1358/1/012079

A supercomputer can have thousands of processor-memory pairs which often referred as processing pins. Each of these pins is connected to each other through networks and passes message using a standard message passing mechanism such as Message Passing Interface. In this research, we consider the routing problem in rectangular mesh network. Each terminal pin in the network needs to be connected with its destination pin for it to function properly. Thus, maximizing the number of connection for each pair of pins and keeping the total energy throughout the network minimum becomes our main objective. In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. While this method guarantees to provide the shortest connection for each single net (if exists), however each routed net will become the obstacles and block later connections. This will add complexities to route later nets and make its routing longer than optimal or sometimes impossible to complete. Therefore, the routing sequence need to be rip-up and all nets need to be re-routed. This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. The outcomes from this research is expected to benefit engineers from electric & electronic industry.