Filters








76,870 Hits in 5.1 sec

Dynamic Task Scheduling Methods in Heterogeneous Systems: A Survey

D. I.GeorgeAmalarethinam, A. Maria Josphin
2015 International Journal of Computer Applications  
Heterogeneous systems create unlimited opportunities and challenges in the fields of parallel processing, design of algorithms, and partitioning and mapping of parallel tasks.  ...  In mapping of parallel tasks, scheduling plays an important role. The scheduling decisions are based on the dynamic parameters that may change during run time.  ...  Heuristic based for Genetic Algorithm Heuristic based genetic algorithm was proposed by Probir Roy et al., which requires less computation time [22] .  ... 
doi:10.5120/19318-0859 fatcat:qxnjvseeajcyfiyzdq4xxtonw4

Improving Evolvability of Genetic Parallel Programming Using Dynamic Sample Weighting [chapter]

Sin Man Cheang, Kin Hong Lee, Kwong Sak Leung
2003 Lecture Notes in Computer Science  
This paper investigates the sample weighting effect on Genetic Parallel Programming (GPP) that evolves parallel programs to solve the training samples captured directly from a real-world system.  ...  This paper compares the performance of four sample weighting (SW) methods, namely, Equal SW (ESW), Class-equal SW (CSW), Static SW (SSW) and Dynamic SW (DSW) on five training sets.  ...  For example, we have applied Dynamic SW (DSW) to Genetic Algorithms (GA) to evolve Finite State Machines [2] .  ... 
doi:10.1007/3-540-45110-2_72 fatcat:vbv57hkmnzes7aaynopsjm4k6i

Parallel genetic algorithm for planning safe and optimal route for ship [article]

Ivan Yanchin, Oleg Petrov
2019 arXiv   pre-print
The method employs an evolutionary algorithm to plan several locally optimal routes and a parallel genetic algorithm to create the final route by optimising the abovementioned set of routes.  ...  The paper represents an algorithm for planning safe and optimal routes for transport facilities with unrestricted movement direction that travel within areas with obstacles.  ...  Figure 11 : 11 Maps chosen for benchmarking Figure 12 : 12 Routes created for the selected maps using 4 parallel genetic algorithms.  ... 
arXiv:1905.05478v1 fatcat:5ufrim23jnabhkwgygav57ympm

Brief Review of Techniques Used to Develop Adaptive Evolutionary Algorithms

José Alberto Bonilla-Vera, Jaime Mora-Vargas, Miguel González-Mendoza, Iván Adrian López-Sánchez, César Jaime Montiel-Moctezuma
2017 Open Cybernetics and Systemics Journal  
This paper presents a brief review of techniques used to allow evolutionary algorithms to adapt to optimization problems in dynamic environments, through exploration of the control parameters of genetic  ...  A description of some of the most used evolutionary techniques is included, with major emphasis on genetic algorithms and their relationship with the problem of adaptation to the environment.  ...  [25] focused on a hybrid algorithm called Hybrid Algorithm-Ant Colony Algorithm Genetic Algorithm (HA-ACAGA) to find optimal solutions for users on dynamic web service composition where user's personal  ... 
doi:10.2174/1874110x01711010001 fatcat:7qs6kxudznaqlet4zduvi6z25y

Research on Hadoop Job Scheduling Based on an Improved Genetic Algorithm

Tao Xue, Xiaoqing You, Minglei Yan
2017 International Journal of Grid and Distributed Computing  
Due to its characteristics, genetic algorithm (GA) has natural parallel advantages in job scheduling.  ...  We propose an improved genetic algorithm, which adopts the reserved strategy of optimal solution to speed up the convergence speed.  ...  algorithm is making simply parallel processing for task, screening the optimal solution only by the genetic operations.  ... 
doi:10.14257/ijgdc.2017.10.2.01 fatcat:a3w4vi6gjzhyzes5je2w3kguze

Current challenges in parallel graph partitioning

François Pellegrini
2011 Comptes rendus. Mecanique  
Yet, as said above, genetic algorithms are too expensive, so that new algorithms have also to be investigated in this respect.  ...  It is most likely that current state-of-the-art local optimization algorithms will be replaced by more global algorithms such as diffusion-based and/or genetic algorithm methods, which are heavier albeit  ... 
doi:10.1016/j.crme.2010.11.004 fatcat:ua4p6fz7u5c5zfppk4pymcohzy

An efficient Network-on-Chip (NoC) based multicore platform for hierarchical parallel genetic algorithms

Yuankun Xue, Zhiliang Qian, Guopeng Wei, Paul Bogdan, Chi-Ying Tsui, Radu Marculescu
2014 2014 Eighth IEEE/ACM International Symposium on Networks-on-Chip (NoCS)  
-k.Xue, DAC,2014] Ratio of DIS phase (using slave processors for calculation) to GA (slave processors are idle) phase Genetic Algorithm (GA) overview q Hierarchical Parallel Genetic Algorithms (HPGA)  ...  q 3 Fitness 3 Genetic Algorithm (GA) overview q Hierarchical Parallel Genetic Algorithms (HPGA) q NoC-based HPGA platform q Island-based HPGA-NoC q Performance bottleneck analysis q Proposed HPGA  ...  Initial destination Set for chromosome packet in the master processor chromosome packet sent through XY routing q DBIM to overcome the master processor injection bandwidth limitations q TDIM to improve  ... 
doi:10.1109/nocs.2014.7008757 dblp:conf/nocs/XueQWBTM14 fatcat:ebccvmjrzbas7k25tr5u6pugnq

A Map-Reduce Model to Find Longest Common Subsequence using Non-alignment Based Approach

Narayan Kandel, Shashidhar Ram Joshi
2020 figshare.com  
An non-alignment based method of sequence comparison using single layer map reduce based scalable parallel algorithm is presented with some optimization for computing LCS between genetic sequences  ...  Due to the emerging growth of bioinformatics applications, new biological sequences with longer length have been used for processing, making it a great challenge for sequential LCS algorithms.  ...  Conclusion A basic model for MapReduce-based parallel algorithm for gene sequence comparison has been developed.  ... 
doi:10.6084/m9.figshare.13005023.v1 fatcat:qtdgu4ihazcdfkfbwvmvrsyh34

Multiscale modeling of developmental processes

David H. Sharp, John Reinitz, Eric Mjolsness
1993 Open systems & information dynamics  
We describe a very simple mathematical idealization of these three levels which combines the crossover search method of genetic algorithms with the developmental models used in our previous work on "genetic  ...  Three broad levels of phenomena axe present: long-term evolution, involving crossover as well as point mutation; a developmental process mapping genetic information to a set of cells and their internal  ...  A different way to use genetic algorithms in the search for successful neural nets is provided by the combination of classifier systems governed by genetic algorithms [13, 14] and Farmer's mapping of  ... 
doi:10.1007/bf02228972 fatcat:hwpkhk7znzeyfaueayhue2zvui

The application of Coarse-Grained Parallel Genetic Algorithm with Hadoop in University Intelligent Course-Timetabling System

Liping Wu
2015 International Journal of Emerging Technologies in Learning (iJET)  
However, parallel genetic algorithm (PGA) not only have the advantages of the traditional genetic algorithm(GA), but also take full advantage of the computing power of parallel computing.  ...  In this paper, based on the cloud computing platform of Hadoop, an improved method of fusing coarse-grained parallel genetic algorithm (CGPGA) and Map/Reduce programming model is deeply researched, and  ...  We use the improved algorithm to make a parallel experiment comparison with the traditional genetic algorithm.  ... 
doi:10.3991/ijet.v10i8.5206 fatcat:e4ay5cneqnfmddqpmd43agf34a

A Review on Parallel Genetic Algorithm Models for Map Reduce in Big Data

Kiranjit Pattnaik, B. S. P Mishra
2016 International Journal of Engineering Research and  
This paper presents a comparative view of different parallel models of genetic algorithm for map reduce and also provides a detail information on different platform and tools for map reduce.  ...  This survey aims to collect and organize most of the recent publications on the parallel genetic algorithms using map reduce.  ...  Verma et. al. used only one map reduce phase for each generation of genetic algorithm, and new map reduce phase is executed for each generation, while for all generation of the genetic algorithm Dino Keco  ... 
doi:10.17577/ijertv5is080400 fatcat:ol7a2rccujgdfe5xhhleibmpb4

A Phoenix++ Based New Genetic Algorithm Involving Mechanism of Simulated Annealing

Luokai Hu, Jin Liu, Chao Liang, Fuchuan Ni, Hang Chen
2015 International Journal of Distributed Sensor Networks  
The other is that our algorithm is a parallel algorithm running on the high-performance parallel platform Phoenix++ instead of a conventional serial genetic algorithm.  ...  efficiency of these traditional genetic algorithms.  ...  Acknowledgments This work was partially supported by grant from the Hubei Provincial Department of Education scientific research programs for youth project (no.  ... 
doi:10.1155/2015/806708 fatcat:bb3u7dbtujhvjd7l5z3rmhrhjq

Optimization Design by Genetic Algorithm Controller for Trajectory Control of a 3-RRR Parallel Robot

2018 Algorithms  
Algorithms 2018, 11, 7 3 of 13 2.1. The Structure of the 3-RRR Planar Parallel Robot The three-dimensional map of the 3-RRR parallel robot is shown in Figure 1 .  ...  Song et al. [23] proposed a new path planning method for a robot based on a genetic algorithm and the Bezier curve.  ...  Figure 1 . 1 Three-dimensional map of the 3-Revolute-Revolute-Revolute (3-RRR) parallel robot. Figure 1 . 1 Three-dimensional map of the 3-Revolute-Revolute-Revolute (3-RRR) parallel robot.  ... 
doi:10.3390/a11010007 fatcat:xprgqjicmfaczgelh2dbl5ylde

Adaptive Application Component Mapping for Parallel Computation Offloading in Variable Environments

2015 KSII Transactions on Internet and Information Systems  
To this end, an adaptive application component mapping algorithm for parallel computation offloading in variable environments is proposed in this paper, which aims at minimizing computation costs and inter-resource  ...  A genetic algorithm enhanced by an elite-based immigrants mechanism is designed to obtain the solution adaptively, which can dynamically adjust the precision of the solution and boost the searching speed  ...  This paper focuses on the application multi-partitioning problem for parallel computation offloading, and proposes an adaptive application component mapping algorithm for parallel computation offloading  ... 
doi:10.3837/tiis.2015.11.005 fatcat:kb4vwuyj6za3zbafneipx7rbga

A Survey of Protein Fold Recognition Algorithms

Mohammed Said Abual-Rub, Rosni Abdullah
2008 Journal of Computer Science  
Moreover, we provided a survey of parallel evolutionary methods for protein fold recognition.  ...  This problem is known as NPhard; researchers have used various methods such as neural networks, Monte Carlo, support vector machine and genetic algorithms to solve it.  ...  [3] A parallel hybrid GA for peptide 3-D structure prediction algorithms Multiple molecular sequence alignment by island parallel Island parallel genetic algorithm for multiple molecular genetic algorithm  ... 
doi:10.3844/jcssp.2008.768.776 fatcat:iqxcwkwe2jeibff4dntd7c6lmm
« Previous Showing results 1 — 15 out of 76,870 results