Mobility overlap-removal based timing-constrained scheduling

Song Chen, Yuan Yao, Takeshi Yoshimura

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings of International Conference on ASIC
ページ417-420
ページ数4
DOI
出版ステータスPublished - 2011
イベント2011 IEEE 9th International Conference on ASIC, ASICON 2011 - Xiamen
継続期間: 2011 10 252011 10 28

Other

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

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

フィンガープリント 「Mobility overlap-removal based timing-constrained scheduling」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル