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...
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 |
Similar Items
-
Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019) -
Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019) -
Obstacle-aware routing problem in a rectangular mesh network
by: Adzhar, Noraziah, et al.
Published: (2015) -
An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
by: Adzhar, Noraziah
Published: (2015) -
Simulated annealing technique for routing in a rectangular MESH network
by: Salleh, Shaharuddin, et al.
Published: (2014)