Mobility overlap-removal based timing-constrained scheduling

Song Chen, Yuan Yao, Takeshi Yoshimura

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

1 Citation (Scopus)

Abstract

In the High-Level Synthesis (HLS), the scheduling is a key problem. Recently, the max-flow scheduling method is proposed for resource-constrained scheduling based on the mobility overlap removal. In the max-flow scheduling method, it is a hard problem how to remove the overlaps optimally. With an improper mobility overlap removal, there might be no feasible solutions with resource constraints. In this work, the mobility overlap removal-based method is extended to deal with timing-constrained scheduling problem, where the timing constraint is given as an input and the resource usage should be minimized. A simulated-annealing based method is used to explore the optimal mobility overlap removal. And, given the overlap-free mobilities, a convex-cost flow based algorithm is proposed to schedule single-cycle operations optimally. At the same time, greedy algorithms are devised to schedule multi-cycle operations. The experimental results show the effectiveness of the proposed method.

Original languageEnglish
Title of host publicationProceedings of International Conference on ASIC
Pages417-420
Number of pages4
DOIs
Publication statusPublished - 2011
Event2011 IEEE 9th International Conference on ASIC, ASICON 2011 - Xiamen
Duration: 2011 Oct 252011 Oct 28

Other

Other2011 IEEE 9th International Conference on ASIC, ASICON 2011
CityXiamen
Period11/10/2511/10/28

Fingerprint

Scheduling
Simulated annealing
Costs

Keywords

  • High-level Synthesis
  • Scheduling

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Chen, S., Yao, Y., & Yoshimura, T. (2011). Mobility overlap-removal based timing-constrained scheduling. In Proceedings of International Conference on ASIC (pp. 417-420). [6157210] https://doi.org/10.1109/ASICON.2011.6157210

Mobility overlap-removal based timing-constrained scheduling. / Chen, Song; Yao, Yuan; Yoshimura, Takeshi.

Proceedings of International Conference on ASIC. 2011. p. 417-420 6157210.

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

Chen, S, Yao, Y & Yoshimura, T 2011, Mobility overlap-removal based timing-constrained scheduling. in Proceedings of International Conference on ASIC., 6157210, pp. 417-420, 2011 IEEE 9th International Conference on ASIC, ASICON 2011, Xiamen, 11/10/25. https://doi.org/10.1109/ASICON.2011.6157210
Chen S, Yao Y, Yoshimura T. Mobility overlap-removal based timing-constrained scheduling. In Proceedings of International Conference on ASIC. 2011. p. 417-420. 6157210 https://doi.org/10.1109/ASICON.2011.6157210
Chen, Song ; Yao, Yuan ; Yoshimura, Takeshi. / Mobility overlap-removal based timing-constrained scheduling. Proceedings of International Conference on ASIC. 2011. pp. 417-420
@inproceedings{4c2076ec18e74c8b80d9852f2d72026a,
title = "Mobility overlap-removal based timing-constrained scheduling",
abstract = "In the High-Level Synthesis (HLS), the scheduling is a key problem. Recently, the max-flow scheduling method is proposed for resource-constrained scheduling based on the mobility overlap removal. In the max-flow scheduling method, it is a hard problem how to remove the overlaps optimally. With an improper mobility overlap removal, there might be no feasible solutions with resource constraints. In this work, the mobility overlap removal-based method is extended to deal with timing-constrained scheduling problem, where the timing constraint is given as an input and the resource usage should be minimized. A simulated-annealing based method is used to explore the optimal mobility overlap removal. And, given the overlap-free mobilities, a convex-cost flow based algorithm is proposed to schedule single-cycle operations optimally. At the same time, greedy algorithms are devised to schedule multi-cycle operations. The experimental results show the effectiveness of the proposed method.",
keywords = "High-level Synthesis, Scheduling",
author = "Song Chen and Yuan Yao and Takeshi Yoshimura",
year = "2011",
doi = "10.1109/ASICON.2011.6157210",
language = "English",
isbn = "9781612841908",
pages = "417--420",
booktitle = "Proceedings of International Conference on ASIC",

}

TY - GEN

T1 - Mobility overlap-removal based timing-constrained scheduling

AU - Chen, Song

AU - Yao, Yuan

AU - Yoshimura, Takeshi

PY - 2011

Y1 - 2011

N2 - In the High-Level Synthesis (HLS), the scheduling is a key problem. Recently, the max-flow scheduling method is proposed for resource-constrained scheduling based on the mobility overlap removal. In the max-flow scheduling method, it is a hard problem how to remove the overlaps optimally. With an improper mobility overlap removal, there might be no feasible solutions with resource constraints. In this work, the mobility overlap removal-based method is extended to deal with timing-constrained scheduling problem, where the timing constraint is given as an input and the resource usage should be minimized. A simulated-annealing based method is used to explore the optimal mobility overlap removal. And, given the overlap-free mobilities, a convex-cost flow based algorithm is proposed to schedule single-cycle operations optimally. At the same time, greedy algorithms are devised to schedule multi-cycle operations. The experimental results show the effectiveness of the proposed method.

AB - In the High-Level Synthesis (HLS), the scheduling is a key problem. Recently, the max-flow scheduling method is proposed for resource-constrained scheduling based on the mobility overlap removal. In the max-flow scheduling method, it is a hard problem how to remove the overlaps optimally. With an improper mobility overlap removal, there might be no feasible solutions with resource constraints. In this work, the mobility overlap removal-based method is extended to deal with timing-constrained scheduling problem, where the timing constraint is given as an input and the resource usage should be minimized. A simulated-annealing based method is used to explore the optimal mobility overlap removal. And, given the overlap-free mobilities, a convex-cost flow based algorithm is proposed to schedule single-cycle operations optimally. At the same time, greedy algorithms are devised to schedule multi-cycle operations. The experimental results show the effectiveness of the proposed method.

KW - High-level Synthesis

KW - Scheduling

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

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

U2 - 10.1109/ASICON.2011.6157210

DO - 10.1109/ASICON.2011.6157210

M3 - Conference contribution

SN - 9781612841908

SP - 417

EP - 420

BT - Proceedings of International Conference on ASIC

ER -