Coarse-Grained ParallelGeneticAlgorithm to solve the Shortest Path Routing problem using Genetic operators
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 1
Abstract
In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computation time reduction along with the use of migration scheme. This algorithm is developed and implemented on an MPI cluster. The effects of migration and its performance is studied in this paper.
Authors and Affiliations
V. PURUSHOTHAM REDDY , G. MICHAEL , M. UMAMAHESHWARI
Keywords
Related Articles
- EP ID EP139837
- DOI -
- Views 128
- Downloads 0
A SURVEY ON EYE-GAZE TRACKING TECHNIQUES
Study of eye-movement is being employed in Human Computer Interaction (HCI) research. Eye - gaze tracking is one of the most challenging problems in the area of computer vision. The goal of this paper is to present a rev...
Green Cloud: Smart Resource Allocation and Optimization using Simulated Annealing Technique
Cloud computing aims to offer utility based IT services by interconnecting large number of computers through a real-time communication network such as the Internet. There has been a significant increase in the power cons...
ADVANCES AT A GLANCE IN PARALLEL COMPUTING
In the history of computational world, sequential uni-processor computers have been exploited for years to solve scientific and business problems. To satisfy the demand of compute & data hungry applications, it was o...
ANALYSING THE ACCEPTANCE CRITERIA AMONG THE CONCEPTS FOR GENERATING AUTOMATED ONTOLOGIES
The semantic search yields fruitful results while searching the concepts. Ontologies play a crucial role in searching the concepts in a semantic way. It is otherwise said that, wherever search is needed, ontology search...