Loop based scheduling for high level synthesis

Hassan F. Al-Sukhni; Habib Youssef; Sadiq M. Sait; Muhammad S.T. Benten

Loop based scheduling for high level synthesis

Hassan F. Al-Sukhni^*
, Habib Youssef
, Sadiq M. Sait
, Muhammad S.T. Benten

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. It partitions the control flow graph of the input specification into subgraphs before scheduling the different paths of each subgraph. Benchmark tests as well as simulation results on the scheduling algorithm indicate that the proposed algorithm results in sizeable reduction in runtime.

Original language	English
Pages (from-to)	76-81
Number of pages	6
Journal	Conference Proceedings - International Phoenix Conference on Computers and Communications
State	Published - 1995

ASJC Scopus subject areas

General Computer Science

Cite this

@article{f5596beff68a42aa980fe37cdf6f830a,

title = "Loop based scheduling for high level synthesis",

abstract = "This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. It partitions the control flow graph of the input specification into subgraphs before scheduling the different paths of each subgraph. Benchmark tests as well as simulation results on the scheduling algorithm indicate that the proposed algorithm results in sizeable reduction in runtime.",

author = "Al-Sukhni, \{Hassan F.\} and Habib Youssef and Sait, \{Sadiq M.\} and Benten, \{Muhammad S.T.\}",

year = "1995",

language = "English",

pages = "76--81",

journal = "Conference Proceedings - International Phoenix Conference on Computers and Communications",

issn = "0896-582X",

}

TY - JOUR

T1 - Loop based scheduling for high level synthesis

AU - Al-Sukhni, Hassan F.

AU - Youssef, Habib

AU - Sait, Sadiq M.

AU - Benten, Muhammad S.T.

PY - 1995

Y1 - 1995

N2 - This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. It partitions the control flow graph of the input specification into subgraphs before scheduling the different paths of each subgraph. Benchmark tests as well as simulation results on the scheduling algorithm indicate that the proposed algorithm results in sizeable reduction in runtime.

AB - This paper describes a new loop based scheduling algorithm. The algorithm aims at reducing the runtime processing complexity of path based scheduling techniques. It partitions the control flow graph of the input specification into subgraphs before scheduling the different paths of each subgraph. Benchmark tests as well as simulation results on the scheduling algorithm indicate that the proposed algorithm results in sizeable reduction in runtime.

UR - https://www.scopus.com/pages/publications/0029238344

M3 - Conference article

AN - SCOPUS:0029238344

SN - 0896-582X

SP - 76

EP - 81

JO - Conference Proceedings - International Phoenix Conference on Computers and Communications

JF - Conference Proceedings - International Phoenix Conference on Computers and Communications

ER -

Loop based scheduling for high level synthesis

Abstract

ASJC Scopus subject areas

Fingerprint

Cite this