Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Journal of Parallel and Distributed Computing
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Proceedings of the 3rd International Conference on Genetic Algorithms
Parallel Genetic Algorithms Population Genetics and Combinatorial Optimization
Proceedings of the 3rd International Conference on Genetic Algorithms
A Fine-Grained Parallel Genetic Algorithm for Distributed Parallel Systems
Proceedings of the 5th International Conference on Genetic Algorithms
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Parallel Metaheuristics: A New Class of Algorithms
Parallel Metaheuristics: A New Class of Algorithms
Journal of Parallel and Distributed Computing
Population structure and particle swarm performance
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Population structure and particle swarm performance
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
An Efficient Fine-grained Parallel Genetic Algorithm Based on GPU-Accelerated
NPC '07 Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops
Optimization Techniques for Solving Complex Problems
Optimization Techniques for Solving Complex Problems
Overcoming partitioning in large ad hoc networks using genetic algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A New Parallel Asynchronous Cellular Genetic Algorithm for de Novo Genomic Sequencing
SOCPAR '09 Proceedings of the 2009 International Conference of Soft Computing and Pattern Recognition
A Parallel Immune Algorithm Based on Fine-Grained Model with GPU-Acceleration
ICICIC '09 Proceedings of the 2009 Fourth International Conference on Innovative Computing, Information and Control
Collaborative multi-swarm PSO for task matching using graphics processing units
Proceedings of the 13th annual conference on Genetic and evolutionary computation
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Parallel genetic algorithms on programmable graphics hardware
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Neighborhood topologies in fully informed and best-of-neighborhood particle swarms
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
A scalable cellular implementation of parallel genetic programming
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Cellular genetic algorithms without additional parameters
The Journal of Supercomputing
Proceedings of the 15th annual conference on Genetic and evolutionary computation
An efficient implementation of the Min-Min heuristic
Computers and Operations Research
Finding extremal sets on the GPU
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In this paper, we present two new parallel algorithms to solve large instances of the scheduling of independent tasks problem. First, we describe a parallel version of the Min-min heuristic. Second, we present GraphCell, an advanced parallel cellular genetic algorithm (CGA) for the GPU. Two new generic recombination operators that take advantage of the massive parallelism of the GPU are proposed for GraphCell. A speedup study shows the high performance of the parallel Min-min algorithm in the GPU versus several CPU versions of the algorithm (both sequential and parallel using multiple threads). GraphCell improves state-of-the-art solutions, especially for larger problems, and it provides an alternative to our GPU Min-min heuristic when more accurate solutions are needed, at the expense of an increased runtime.