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

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

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 rout...

Full description

Bibliographic Details
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
QA75 Electronic computers. Computer science
TK Electrical engineering. Electronics Nuclear engineering
Online Access:http://umpir.ump.edu.my/id/eprint/28577/
http://umpir.ump.edu.my/id/eprint/28577/1/Routing%20problem%20in%20rectangular%20mesh%20network%20using%20shortest.pdf

Similar Items

Similar Items