2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery 2015
DOI: 10.1109/cyberc.2015.33
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Parallel Genetic Algorithm for Graph Coloring Problem Based on CUDA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…Concerning brain storm optimization (BSO), Jin and Qin [34] presented GPU-based manner whilst Ma et al [35] proposed parallelized BSO algorithm based on Spark framework for association rule mining. Similar works in [36,37] used GPU and FPGA to accelerate genetic algorithm (GA). What deserves attention is that Garcia et al [38] achieved parallel implementation and comparison of teaching-learning based optimization (TLBO) and Jaya on many-core GPU.…”
Section: Related Workmentioning
confidence: 99%
“…Concerning brain storm optimization (BSO), Jin and Qin [34] presented GPU-based manner whilst Ma et al [35] proposed parallelized BSO algorithm based on Spark framework for association rule mining. Similar works in [36,37] used GPU and FPGA to accelerate genetic algorithm (GA). What deserves attention is that Garcia et al [38] achieved parallel implementation and comparison of teaching-learning based optimization (TLBO) and Jaya on many-core GPU.…”
Section: Related Workmentioning
confidence: 99%
“…These calculations are actualized on both SIMD and MIMD parallel models and tried for speed, effectiveness, and for shading arbitrary triangulated networks and diagrams from sparse matrix. Buhua Chen et al [2] introduced a new parallel genetic algorithm to take care of the Graph coloring problem (GCP) in view of Computer Unified Device Architecture (CUDA). All the operators such as initialization, crossover, mutation and selection are designed to be parallel in threads.…”
Section: Related Workmentioning
confidence: 99%