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: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/24139/ 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 |