Data path scheduling for two-level pipelining

C. Y.Roger Chen, Michael Z. Moricz

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

1 Scopus citations

Abstract

An approach to scheduling iterative tasks on two-level pipelines under resource constraints, such that the executions of both high-level iterations and low-level operations are pipelined, is presented. The authors limit the discussion to the case where none of the function units is pipelined and pipelining is performed only at the global iteration level. It is then generalized to the case where both global iterations and functional units are pipelined. The problem is presented as an integer linear programming formulation, and the authors obtain the best solution which minimizes the total execution time. Experimental results show that the proposed algorithm produces optimal solutions for all the test cases within a few seconds.

Original languageEnglish (US)
Title of host publicationProceedings - Design Automation Conference
PublisherIEEE Computer Society
Pages603-606
Number of pages4
ISBN (Print)0818691492, 9780818691492
DOIs
StatePublished - Jan 1 1991
EventProceedings of the 28th ACM/IEEE Design Automation Conference - San Francisco, CA, USA
Duration: Jun 17 1991Jun 21 1991

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0146-7123

Other

OtherProceedings of the 28th ACM/IEEE Design Automation Conference
CitySan Francisco, CA, USA
Period6/17/916/21/91

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Data path scheduling for two-level pipelining'. Together they form a unique fingerprint.

  • Cite this

    Chen, C. Y. R., & Moricz, M. Z. (1991). Data path scheduling for two-level pipelining. In Proceedings - Design Automation Conference (pp. 603-606). (Proceedings - Design Automation Conference). IEEE Computer Society. https://doi.org/10.1145/127601.127740