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

QR Code

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 QA76 Computer software
Online Access:	http://umpir.ump.edu.my/id/eprint/27917/ http://umpir.ump.edu.my/id/eprint/27917/1/Routing%20problem%20in%20rectangular%20mesh%20network%20using%20shortest.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 Dijkstra’s based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2018)

Vehicle routing with shortest path system based Floyd Warshall Technique
by: Talib, Mohamad Shukor, et al.
Published: (2006)

A review on autonomous mobile robot path planning algorithms
by: Noraziah, Adzhar, et al.
Published: (2020)

Hopfield model for shortest path computation and routing in ATM network / by Lee Chee Weng
by: Lee, Chee Weng
Published: (2001)

Simulated annealing technique for reducing communication in mesh networks
by: Salleh, Shaharuddin
Published: (2005)

Simulation of identifying shortest path walkway in library by using ant colony optimization
by: Chui Teng, Chan
Published: (2012)

Simulation of identifying shortest path walkway using particle swarm optimization (PSO)
by: Kae Shin, Yong
Published: (2012)

A hybrid algorithm for finding shortest path in network routing.
by: Soltan Aghaei, Mohammad Reza, et al.
Published: (2009)

Particle swarm optimization with noising metaheuristics for solving network shortest path problem
by: Mohemmed, Ammar W., et al.
Published: (2007)

Traffic Balancing Method in Shortest Path Routing
by: Mohamed Abdulqader, Makarem
Published: (2007)

Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
by: Wamiliana, Wamiliana, et al.
Published: (2015)

Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis
by: Awalin, Lilik J., et al.
Published: (2021)

Dynamic Multiprocessor Scheduling Model For The Reconfigurable Mesh Computing Networks
by: Salleh, Shaharuddin, et al.
Published: (2002)

Solving shortest path problem using particle swarm optimization
by: Mohemmed, Ammar W., et al.
Published: (2008)

An origin-based model for unique shortest path routing
by: Zhang, Changyong
Published: (2016)

Greedy heuristic for the workforce scheduling and routing problem
by: Russell, Samuel
Published: (2017)

Bayesian Networks With Greedy Backward Elimination In Feature Selection For Data Classification
by: Ang, Sau Loong
Published: (2019)

Improvements Over Two Phase Shortest Path Algorithm
by: Qureshi, M.A., et al.
Published: (2010)

The application of metaheuristics in network routing and inventory routing problem / Huda Zuhrah Ab Halim
by: Huda Zuhrah, Ab Halim
Published: (2012)

A genetic algorithm solution to the shortest path problem in OSPF and MPLS / by Tee Wee Jing.
by: Tee Wee Jing, Wee Jing
Published: (2002)

A Matrix Usage for Load Balancing in Shortest Path Routing
by: Mustafa, Nor Musliza
Published: (2009)

n-cutting site of DNA splicing language for single string and palindromic rule
by: Nooradelena, Mohd Ruslim, et al.
Published: (2022)

Interstreet crossing issues in single-row routing
by: Salleh, Shaharuddin
Published: (2006)

Interstreet crossing issues in single-row routing
by: Salleh, Shaharuddin
Published: (2006)

An overview of mobile robot path planning
by: Noraziah, Adzhar, et al.
Published: (2019)

Dynamic source routing (DSR) protocol with euclidean effect in mobile ad hoc networks
by: Lee, Muhammad Hisyam, et al.
Published: (2000)

Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs
by: Qureshi, MA., et al.
Published: (2010)

A study on lower bound of direct proportional length-based DNA computing for shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2005)

Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2007)

A review: On path planning optimization criteria and mobile robot navigation
by: Anis Naema Atiyah, Rafai, et al.
Published: (2021)

Enhanced open shortest path first (OSPF) protocol using parallel tabu search - ring in wimax mesh network
by: Ahmed, Bilal Abdulhaq
Published: (2013)

A variable combinatorial test suite strategy based on modified greedy algorithm
by: Homaid, Ameen A. Ba, et al.
Published: (2015)

A new particle swarm optimization based algorithm for solving shortest-paths tree problem
by: Mohemmed, Ammar W., et al.
Published: (2007)

Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics
by: Mohemmed, Ammar W., et al.
Published: (2007)

Single Machine Common Due Date Scheduling Problems Using Neural Network
by: Hamad, Abdelaziz, et al.
Published: (2002)

Enhanced simulated annealing technique for the single-row routing problem
by: Salleh, Shaharuddin, et al.
Published: (2002)

Study On Practice Swarm Optimization Based Search Algorithms For Network Shortest Path Problems
by: W.muhemmed, Ammar
Published: (2007)

Hybrid concentration-controlled direct-proportional length-based DNA computing for numerical optimization of the shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2006)

A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines
by: Hamad, Abdelaziz, et al.
Published: (2001)