Scheduling conditional data-flow graphs with resource sharing

Author

Siddhiwala, Jayesli ; Chao, Liang-Fang

Author_Institution

Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA

fYear

1995

fDate

16-18 Mar 1995

Firstpage

94

Lastpage

97

Abstract

This paper proposes pipeline scheduling algorithms for conditional branches and loop constructs, which are represented in the form of a conditional data-flow graph, where each node is associated with a condition vector. A novel data structure for dynamic resource sharing and a novel scheduling algorithm for resource sharing are proposed. Based on such a data structure and a modified rotation scheduling technique, a scheduling algorithm that performs resource sharing and loop pipelining simultaneously is designed

Keywords

data flow graphs; data structures; high level synthesis; parallel algorithms; pipeline processing; processor scheduling; resource allocation; condition vector; conditional branches; conditional data-flow graphs; data structure; dynamic resource sharing; high level synthesis; loop constructs; loop pipelining; pipeline scheduling algorithms; resource sharing algorithm; rotation scheduling technique; Data engineering; Data structures; Dynamic scheduling; Flow graphs; Pipeline processing; Processor scheduling; Resource management; Scheduling algorithm; Signal processing algorithms; Tellurium;

fLanguage

English

Publisher

ieee

Conference_Titel

VLSI, 1995. Proceedings., Fifth Great Lakes Symposium on

Conference_Location

Buffalo, NY

ISSN

1066-1395

Print_ISBN

0-8186-7035-5

Type

conf

DOI

10.1109/GLSV.1995.516032

Filename

516032