70 likes | 340 Views
Parallel Genetic Algorithm for Solving Shortest Path Routing Problem. Coarse-grained GA. Master-slave GA. Node. Master. Node. Node. Slave. Slave. Slave. Node. Node. Genetic Algorithm
E N D
Parallel Genetic Algorithm for Solving Shortest Path Routing Problem Coarse-grained GA Master-slave GA Node Master Node Node Slave Slave Slave Node Node Genetic Algorithm A genetic algorithm (GA) is a search technique used in computing to find exact or approximate solutions to optimization and search problems. Genetic algorithms are categorized as global search heuristics. Parallel genetic algorithm divides the GA operations into multiple chunks to be executed simultaneously on multiple processors. There are four major types of parallel GA which are master-slave GA, fine-grained GA, coarse-grained GA and hierarchical hybrids NSRG Universiti Tenaga Nasional
Universiti Tenaga Nasional Introduction NSRG stands for Network and Security Research Group, is a research group that is primarily focuses on contemporary research areas in networking and network security. Among the areas that we are currently exploring are network quality-of-service (QoS), mobile and ad-hoc network (MANET), wireless sensor network and mobile applications development. Members of this group consist of a group of lecturers from Systems and Networking department in the College of IT, research associates, postgraduate students and also undergraduate students. NSRG