Max-flow scheduling in high-level synthesis

G. E. Liangwei, Song Chen, Kazutoshi Wakabayashi, Takashi Takenaka, Takeshi Yoshimura

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Scheduling, an essential step in high-level synthesis, is an intractable process. Traditional heuristic scheduling methods usually search schedules directly in the entire solution space. In this paper, we propose the idea of searching within an intermediate solution space (ISS). We put forward a max-flow scheduling method that heuristically prunes the solution space into a specific ISS and finds the optimum of ISS in polynomial time. The proposed scheduling algorithm has some unique features, such as the correction of previous scheduling decisions in a later stage, the simultaneous scheduling of all the operations, and the optimization of more complicated objectives. Aided by the max-flow scheduling method, we implement the optimization of the IC power-ground integrity problem at the behavior level conveniently. Experiments on well-known benchmarks show that without requiring additional resources or prolonging schedule latency, the proposed scheduling method can find a schedule that draws current more stably from a supply, which mitigates the voltage fluctuation in the on-chip power distribution network.

Original languageEnglish
Pages (from-to)1940-1948
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE90-A
Issue number9
DOIs
Publication statusPublished - 2007 Sep

Fingerprint

High-level Synthesis
Scheduling
Schedule
Entire Solution
Power Distribution
Optimization
Distribution Network
High level synthesis
Scheduling algorithms
Scheduling Algorithm
Search Methods
Electric power distribution
Integrity
Latency
Polynomial time
Chip
Voltage
Polynomials
Heuristics
Fluctuations

Keywords

  • High-level synthesis
  • Power-ground integrity
  • Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

Max-flow scheduling in high-level synthesis. / Liangwei, G. E.; Chen, Song; Wakabayashi, Kazutoshi; Takenaka, Takashi; Yoshimura, Takeshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E90-A, No. 9, 09.2007, p. 1940-1948.

Research output: Contribution to journalArticle

Liangwei, G. E. ; Chen, Song ; Wakabayashi, Kazutoshi ; Takenaka, Takashi ; Yoshimura, Takeshi. / Max-flow scheduling in high-level synthesis. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2007 ; Vol. E90-A, No. 9. pp. 1940-1948.
@article{b87dcfee41ca4114886eca2fa38d3285,
title = "Max-flow scheduling in high-level synthesis",
abstract = "Scheduling, an essential step in high-level synthesis, is an intractable process. Traditional heuristic scheduling methods usually search schedules directly in the entire solution space. In this paper, we propose the idea of searching within an intermediate solution space (ISS). We put forward a max-flow scheduling method that heuristically prunes the solution space into a specific ISS and finds the optimum of ISS in polynomial time. The proposed scheduling algorithm has some unique features, such as the correction of previous scheduling decisions in a later stage, the simultaneous scheduling of all the operations, and the optimization of more complicated objectives. Aided by the max-flow scheduling method, we implement the optimization of the IC power-ground integrity problem at the behavior level conveniently. Experiments on well-known benchmarks show that without requiring additional resources or prolonging schedule latency, the proposed scheduling method can find a schedule that draws current more stably from a supply, which mitigates the voltage fluctuation in the on-chip power distribution network.",
keywords = "High-level synthesis, Power-ground integrity, Scheduling",
author = "Liangwei, {G. E.} and Song Chen and Kazutoshi Wakabayashi and Takashi Takenaka and Takeshi Yoshimura",
year = "2007",
month = "9",
doi = "10.1093/ietfec/e90-a.9.1940",
language = "English",
volume = "E90-A",
pages = "1940--1948",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

T1 - Max-flow scheduling in high-level synthesis

AU - Liangwei, G. E.

AU - Chen, Song

AU - Wakabayashi, Kazutoshi

AU - Takenaka, Takashi

AU - Yoshimura, Takeshi

PY - 2007/9

Y1 - 2007/9

N2 - Scheduling, an essential step in high-level synthesis, is an intractable process. Traditional heuristic scheduling methods usually search schedules directly in the entire solution space. In this paper, we propose the idea of searching within an intermediate solution space (ISS). We put forward a max-flow scheduling method that heuristically prunes the solution space into a specific ISS and finds the optimum of ISS in polynomial time. The proposed scheduling algorithm has some unique features, such as the correction of previous scheduling decisions in a later stage, the simultaneous scheduling of all the operations, and the optimization of more complicated objectives. Aided by the max-flow scheduling method, we implement the optimization of the IC power-ground integrity problem at the behavior level conveniently. Experiments on well-known benchmarks show that without requiring additional resources or prolonging schedule latency, the proposed scheduling method can find a schedule that draws current more stably from a supply, which mitigates the voltage fluctuation in the on-chip power distribution network.

AB - Scheduling, an essential step in high-level synthesis, is an intractable process. Traditional heuristic scheduling methods usually search schedules directly in the entire solution space. In this paper, we propose the idea of searching within an intermediate solution space (ISS). We put forward a max-flow scheduling method that heuristically prunes the solution space into a specific ISS and finds the optimum of ISS in polynomial time. The proposed scheduling algorithm has some unique features, such as the correction of previous scheduling decisions in a later stage, the simultaneous scheduling of all the operations, and the optimization of more complicated objectives. Aided by the max-flow scheduling method, we implement the optimization of the IC power-ground integrity problem at the behavior level conveniently. Experiments on well-known benchmarks show that without requiring additional resources or prolonging schedule latency, the proposed scheduling method can find a schedule that draws current more stably from a supply, which mitigates the voltage fluctuation in the on-chip power distribution network.

KW - High-level synthesis

KW - Power-ground integrity

KW - Scheduling

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

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

U2 - 10.1093/ietfec/e90-a.9.1940

DO - 10.1093/ietfec/e90-a.9.1940

M3 - Article

AN - SCOPUS:68949093691

VL - E90-A

SP - 1940

EP - 1948

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 9

ER -