DocumentCode
2067539
Title
Genetic Algorithm based pipeline scheduling in high-level synthesis
Author
Xiaohao Gao ; Yoshimura, Tetsuzo
Author_Institution
Grad. Sch. of Inf., Production & Syst., Waseda Univ., Kitakyushu, Japan
fYear
2013
fDate
28-31 Oct. 2013
Firstpage
1
Lastpage
4
Abstract
In this work, we present a Genetic Algorithm (GA) based method for pipeline scheduling optimization. The objective is to minimize the circuit area under both data initiation interval and pipeline latency constraints. In the initialization, the scheduler generates a series of solutions between As Soon As Possible (ASAP) and As Late As Possible (ALAP) interval. Afterwards a Linear Programming (LP) algorithm is applied for transforming unfeasible solutions to feasible solutions, which are input to GA for searching the optimization result. In the experiments, our proposed algorithm achieves an average of 29.74% area improvement by comparing with ASAP and ALAP methods.
Keywords
genetic algorithms; high level synthesis; linear programming; ALAP interval; ALAP method; ASAP interval; ASAP method; GA method; LP algorithm; as-late as-possible interval; as-soon as-possible interval; circuit area minimization; data initiation interval; genetic algorithm-based pipeline scheduling; high-level synthesis; linear programming algorithm; pipeline latency constraints; pipeline scheduling optimization; Benchmark testing; Genetic algorithms; Linear programming; Optimization; Pipelines; Scheduling; Scheduling algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
ASIC (ASICON), 2013 IEEE 10th International Conference on
Conference_Location
Shenzhen
ISSN
2162-7541
Print_ISBN
978-1-4673-6415-7
Type
conf
DOI
10.1109/ASICON.2013.6811982
Filename
6811982
Link To Document