Genetic Algorithm based pipeline scheduling in high-level synthesis

Xiaohao Gao, Takeshi Yoshimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings of International Conference on ASIC
PublisherIEEE Computer Society
ISBN (Print)9781467364157
DOIs
Publication statusPublished - 2013
Event2013 IEEE 10th International Conference on ASIC, ASICON 2013 - Shenzhen
Duration: 2013 Oct 282013 Oct 31

Other

Other2013 IEEE 10th International Conference on ASIC, ASICON 2013
CityShenzhen
Period13/10/2813/10/31

Fingerprint

Pipelines
Genetic algorithms
Scheduling
Linear programming
Networks (circuits)
Experiments
High level synthesis

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Gao, X., & Yoshimura, T. (2013). Genetic Algorithm based pipeline scheduling in high-level synthesis. In Proceedings of International Conference on ASIC [6811982] IEEE Computer Society. https://doi.org/10.1109/ASICON.2013.6811982

Genetic Algorithm based pipeline scheduling in high-level synthesis. / Gao, Xiaohao; Yoshimura, Takeshi.

Proceedings of International Conference on ASIC. IEEE Computer Society, 2013. 6811982.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gao, X & Yoshimura, T 2013, Genetic Algorithm based pipeline scheduling in high-level synthesis. in Proceedings of International Conference on ASIC., 6811982, IEEE Computer Society, 2013 IEEE 10th International Conference on ASIC, ASICON 2013, Shenzhen, 13/10/28. https://doi.org/10.1109/ASICON.2013.6811982
Gao X, Yoshimura T. Genetic Algorithm based pipeline scheduling in high-level synthesis. In Proceedings of International Conference on ASIC. IEEE Computer Society. 2013. 6811982 https://doi.org/10.1109/ASICON.2013.6811982
Gao, Xiaohao ; Yoshimura, Takeshi. / Genetic Algorithm based pipeline scheduling in high-level synthesis. Proceedings of International Conference on ASIC. IEEE Computer Society, 2013.
@inproceedings{30636ff273eb47788373aedd9207ad62,
title = "Genetic Algorithm based pipeline scheduling in high-level synthesis",
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.",
author = "Xiaohao Gao and Takeshi Yoshimura",
year = "2013",
doi = "10.1109/ASICON.2013.6811982",
language = "English",
isbn = "9781467364157",
booktitle = "Proceedings of International Conference on ASIC",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Genetic Algorithm based pipeline scheduling in high-level synthesis

AU - Gao, Xiaohao

AU - Yoshimura, Takeshi

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84901352270&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901352270&partnerID=8YFLogxK

U2 - 10.1109/ASICON.2013.6811982

DO - 10.1109/ASICON.2013.6811982

M3 - Conference contribution

SN - 9781467364157

BT - Proceedings of International Conference on ASIC

PB - IEEE Computer Society

ER -