Partitioning and scheduling of asynchronous pipelines

Author

Kuo, Yau-Hwang ; Lo, Shaw-Pyng

Author_Institution

Inst. for Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan

fYear

1992

fDate

4-8 May 1992

Firstpage

574

Lastpage

579

Abstract

The authors propose algorithms for partitioning and scheduling of asynchronous pipelines. Resource sharing is taken into account. The focus is on the automated data path synthesis of asynchronous pipelines. A heuristic algorithm based on a probabilistic approach is described for partitioning the circuit description into pipelined stages. Some mathematical formulas and a clique partitioning approach are proposed to determine resource sharable stages. A simulated evolution algorithm is outlined for scheduling operations into stages. Experiments and simulations have confirmed the efficiency of the algorithms.<>

Keywords

circuit layout CAD; scheduling; simulated annealing; algorithms; asynchronous pipelines; automated data path synthesis; clique partitioning; heuristic algorithm; partitioning; probabilistic approach; resource sharable stages; resource sharing; scheduling; simulated evolution algorithm; Circuit simulation; Circuit synthesis; Clocks; Delay; Integrated circuit interconnections; Latches; Partitioning algorithms; Pipelines; Resource management; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

CompEuro '92 . 'Computer Systems and Software Engineering',Proceedings.

Conference_Location

The Hague, Netherlands

Print_ISBN

0-8186-2760-3

Type

conf

DOI

10.1109/CMPEUR.1992.218470

Filename

218470