Schedule-based multi-dimensional retiming on data flow graphs

Nelson Luiz Passos, Edwin Hsing Mean Sha, Steven C. Bass

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

Transformation techniques are usually applied to get optimal execution rates in parallel and/or pipeline systems. The retiming technique is a common and valuable tool in one-dimensional problems, represented by Data Flow Graphs (DFGs) such as DSP filters, which can maximize the parallelism of a loop body represented by a DFG. Since most scientific or DSP applications are recursive or iterative, to increase the parallelism of the loop body can substantially decrease the overall computation time. This paper develops a novel multi-dimensional retiming technique that considers the final schedule as part of the process. The description and the correctness of our algorithm are presented in the paper.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages195-199
Number of pages5
ISBN (Print)0818656026
StatePublished - 1994
Externally publishedYes
EventProceedings of the 8th International Parallel Processing Symposium - Cancun, Mex
Duration: 26 Apr 199429 Apr 1994

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Conference

ConferenceProceedings of the 8th International Parallel Processing Symposium
CityCancun, Mex
Period26/04/9429/04/94

Fingerprint

Dive into the research topics of 'Schedule-based multi-dimensional retiming on data flow graphs'. Together they form a unique fingerprint.

Cite this