GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs

Yan Zhao (), Liping Chen (), Gang Xie (), Jianjun Zhao () and Jianwan Ding ()
Additional contact information
Yan Zhao: Huazhong University of Science and Technology
Liping Chen: Huazhong University of Science and Technology
Gang Xie: Huazhong University of Science and Technology
Jianjun Zhao: Huazhong University of Science and Technology
Jianwan Ding: Huazhong University of Science and Technology

Journal of Combinatorial Optimization, 2018, vol. 35, issue 1, No 21, 293-317

Abstract: Abstract This paper studies the problem of efficiently scheduling dependent computational tasks on heterogeneous computing systems. Computational tasks with precedence constraints are commonly represented by a directed acyclic graph (DAG). Four commonly used algorithms including a cellular genetic algorithm (CGA) are performed for scheduling a special type of DAGs derived from physical system simulation programs. Experimental results show that CGA outperforms the other three algorithms. However, when solving large instances of the dependent task scheduling problem, which are often the case for physical system simulation programs, a CPU implementation of the genetic algorithms can be extremely time consuming. The time complexity of producing a generation with a CPU is $$O(n_{cell} \; n^{2})$$ O ( n c e l l n 2 ) , where n is the size of DAG, and $$n_{cell}$$ n c e l l is the size of population. To improve runtimes, this paper presents a graphics processing unit (GPU) based implementation of the genetic algorithms. The time complexity of creating a new generation with a GPU is reduced to O(n). The experimental results show that significant speedups can be achieved by harnessing the power of a modern GPU.

Keywords: Directed acyclic graph; Heterogeneous scheduling; Cellular genetic algorithm; GPU (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0007-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:1:d:10.1007_s10878-016-0007-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0007-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().