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 114
- Downloads 0
Modified Pixel Sieve Method for Visual Cryptography
Visual cryptography encodes a secret image into n shares which are distributed to n participants. Pixel Sieve method was proposed recently to encode an image into shares, but the encryption quality is poor. In this paper...
COMPONENT TESTING USING FINITE AUTOMATA
In Component-Based Software Engineering (CBSE), software systems are mainly constructed with reusable components, such as third-party components and in-house built components. Component Based Software Development (CBSD)...
Solving Scheduling problems using Selective Breeding Algorithm and Hybrid Algorithm
The n-job, m-machine scheduling problem is one of the general scheduling problems in a system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are...
STUDY AND PERFORMANCE ANALYSIS OF THE WYLLIE’S LIST RANKING ALGORITHM USING VARIOUS PARALLEL PROGRAMMING MODELS
The Wyllie’s list ranking algorithm takes a linked list data structure as an input and it pass the linked list successor elements to the succ1 array to find the Rank. The algorithm depends upon the Pointer jumping operat...
ANFIS IN THE CHARACTERIZATION OF FIBROSIS AND CARCINOMA USING LUNG CT IMAGES
The diagnosis of tuberculosis and lung cancer is difficult, as symptoms of both diseases are similar. Due to high TB prevalence and radiological similarities, a large number of lung cancer patients initially get wrongly...