Publication detail

An Efficient List-Based Scheduling Algorithm for High-Level-Synthesis

SLLAME M., A., DRÁBEK, V.

Original Title

An Efficient List-Based Scheduling Algorithm for High-Level-Synthesis

English Title

An Efficient List-Based Scheduling Algorithm for High-Level-Synthesis

Type

conference paper

Language

en

Original Abstract

Scheduling is considered as the most important task in high-level synthesis process. This paper presents a novel list-based scheduling algorithm based on incorporating some information extracted from data flow graph (DFG) structure to guide the scheduler to find near-optimal/optimal schedules quickly.

English abstract

Scheduling is considered as the most important task in high-level synthesis process. This paper presents a novel list-based scheduling algorithm based on incorporating some information extracted from data flow graph (DFG) structure to guide the scheduler to find near-optimal/optimal schedules quickly.

Keywords

Scheduling, High-Level-Synthesis

RIV year

2002

Released

04.09.2002

Publisher

IEEE Computer Society Press

Location

Dortmund, Germany

ISBN

0-7695-1790-0

Book

EUROMICRO Symposium on Digital System Design (DSD2002): Architecture, Methods and Tools, IEEE Computer Society

Edition

IEEE Computer Society

Pages from

316

Pages to

323

Pages count

8

Documents

BibTex


@inproceedings{BUT10042,
  author="Azeddien {Sllame M.} and Vladimír {Drábek}",
  title="An Efficient List-Based Scheduling Algorithm for High-Level-Synthesis",
  annote="Scheduling is considered as the most important task in high-level synthesis process. This paper presents a novel list-based scheduling algorithm based on incorporating some information extracted from data flow graph (DFG) structure to guide the scheduler to find near-optimal/optimal schedules quickly.",
  address="IEEE Computer Society Press",
  booktitle="EUROMICRO Symposium on Digital System Design (DSD2002): Architecture, Methods and Tools, IEEE Computer Society",
  chapter="10042",
  edition="IEEE Computer Society",
  institution="IEEE Computer Society Press",
  year="2002",
  month="september",
  pages="316--323",
  publisher="IEEE Computer Society Press",
  type="conference paper"
}