Detail publikace

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

Originální název

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

Anglický název

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

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

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"
}