Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

A supercomputer can have thousands of replicated processor-memory pairs which are called 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...

Full description

Saved in:
Bibliographic Details
Main Authors: Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad
Format: Conference or Workshop Item
Language:English
English
Published: 2018
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/24139/1/21.%20Routing%20problem%20in%20rectangular%20mesh%20network.pdf
http://umpir.ump.edu.my/id/eprint/24139/2/21.1%20Routing%20problem%20in%20rectangular%20mesh%20network.pdf
http://umpir.ump.edu.my/id/eprint/24139/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Malaysia Pahang
Language: English
English
id my.ump.umpir.24139
record_format eprints
spelling my.ump.umpir.241392019-02-13T08:41:07Z http://umpir.ump.edu.my/id/eprint/24139/ Routing problem in rectangular mesh network using Dijkstra’s based Greedy method Noraziah, Adzhar Shaharuddin, Salleh Yuhani, Yusof Muhammad Azrin, Ahmad QA Mathematics A supercomputer can have thousands of replicated processor-memory pairs which are called 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. 2018 Conference or Workshop Item NonPeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/24139/1/21.%20Routing%20problem%20in%20rectangular%20mesh%20network.pdf pdf en http://umpir.ump.edu.my/id/eprint/24139/2/21.1%20Routing%20problem%20in%20rectangular%20mesh%20network.pdf Noraziah, Adzhar and Shaharuddin, Salleh and Yuhani, Yusof and Muhammad Azrin, Ahmad (2018) Routing problem in rectangular mesh network using Dijkstra’s based Greedy method. In: Simposium Kebangsaan Sains Matematik Ke 26 (SKSM26) 2018, 28 - 29 November 2018 , Universiti Malaysia Sabah, Kota Kinabalu Sabah. pp. 1-6.. (Unpublished)
institution Universiti Malaysia Pahang
building UMP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Pahang
content_source UMP Institutional Repository
url_provider http://umpir.ump.edu.my/
language English
English
topic QA Mathematics
spellingShingle QA Mathematics
Noraziah, Adzhar
Shaharuddin, Salleh
Yuhani, Yusof
Muhammad Azrin, Ahmad
Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
description A supercomputer can have thousands of replicated processor-memory pairs which are called 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.
format Conference or Workshop Item
author Noraziah, Adzhar
Shaharuddin, Salleh
Yuhani, Yusof
Muhammad Azrin, Ahmad
author_facet Noraziah, Adzhar
Shaharuddin, Salleh
Yuhani, Yusof
Muhammad Azrin, Ahmad
author_sort Noraziah, Adzhar
title Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
title_short Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
title_full Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
title_fullStr Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
title_full_unstemmed Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
title_sort routing problem in rectangular mesh network using dijkstra’s based greedy method
publishDate 2018
url http://umpir.ump.edu.my/id/eprint/24139/1/21.%20Routing%20problem%20in%20rectangular%20mesh%20network.pdf
http://umpir.ump.edu.my/id/eprint/24139/2/21.1%20Routing%20problem%20in%20rectangular%20mesh%20network.pdf
http://umpir.ump.edu.my/id/eprint/24139/
_version_ 1643669767006978048