Partitioning and scheduling of asynchronous pipelines

Yau Hwang Kuo, Shaw Pyng Lo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - Computer Systems and Software Engineering
Subtitle of host publication6th Annual European Computer Conference, CompEuro 1992
EditorsPatrick Dewilde, Joos Vandewalle
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages574-579
Number of pages6
ISBN (Electronic)0818627603, 9780818627606
DOIs
Publication statusPublished - 1992
Event6th Annual European Computer Conference on Computer Systems and Software Engineering, CompEuro 1992 - The Hague, Netherlands
Duration: 1992 May 41992 May 8

Publication series

NameProceedings - Computer Systems and Software Engineering: 6th Annual European Computer Conference, CompEuro 1992

Conference

Conference6th Annual European Computer Conference on Computer Systems and Software Engineering, CompEuro 1992
CountryNetherlands
CityThe Hague
Period92-05-0492-05-08

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software
  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Partitioning and scheduling of asynchronous pipelines'. Together they form a unique fingerprint.

Cite this