Cluster-oriented scheduling in pipelined data path synthesis

Author

Chang, Ching-Tang ; Rose, Kenneth ; Walker, Robert A.

Author_Institution

Center for Integrated Electron., Rensselaer Polytech. Inst., Troy, NY, USA

fYear

1993

fDate

3-6 Oct 1993

Firstpage

374

Lastpage

378

Abstract

We present a new algorithm for cluster-oriented scheduling (COS) in pipelined data path synthesis. First, cluster structure information is extracted from the corresponding linear graph representation of a data flow graph (DFG). Then, scheduling and allocation globally interact with the cluster information under the timing constraints of pipeline latency and data initialization interval (DII). Using this technique, the costs of registers, multiplexors, and interconnection were reduced dramatically in both the FIR and elliptic filter examples

Keywords

data flow graphs; high level synthesis; logic design; pipeline processing; scheduling; COS; DII; FIR; cluster structure information; cluster-oriented scheduling; data flow graph; data initialization interval; elliptic filter examples; linear graph representation; pipeline latency; pipelined data path synthesis; timing constraints; Clustering algorithms; Data flow computing; Flow graphs; Hardware; High level synthesis; Job shop scheduling; Laboratories; Pipelines; Processor scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on

Conference_Location

Cambridge, MA

Print_ISBN

0-8186-4230-0

Type

conf

DOI

10.1109/ICCD.1993.393349

Filename

393349