Scheduling Data-Flow Graphs via Retiming and Unfolding

Authors:
Liang-Fang Chao;Edwin Hsing-Mean Sha
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1997

Citing 5
Cited 25

Data structures and network algorithms

Data structures and network algorithms
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding

IEEE Transactions on Computers
Rotation scheduling: a loop pipelining algorithm

DAC '93 Proceedings of the 30th international Design Automation Conference
Scheduling and behavioral transformation for parallel systems

Scheduling and behavioral transformation for parallel systems
Static scheduling for synthesis of DSP algorithms on various models

Journal of VLSI Signal Processing Systems

Resource constrained dataflow retiming heuristics for VLIW ASIPs

CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Power-aware modulo scheduling for high-performance VLIW processors

ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Optimal code size reduction for software-pipelined and unfolded loops

Proceedings of the 15th international symposium on System Synthesis
Hardware-Software partitioning and pipelined scheduling of transformative applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A First Step Towards Time Optimal Software Pipelining of Loops with Control Flows

CC '01 Proceedings of the 10th International Conference on Compiler Construction
Design space minimization with timing and code size optimization for embedded DSP

Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Code size reduction technique and implementation for software-pipelined DSP applications

ACM Transactions on Embedded Computing Systems (TECS)
Time optimal software pipelining of loops with control flows

International Journal of Parallel Programming
Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation

Journal of VLSI Signal Processing Systems
On exploring inter-iteration parallelism within rate-balanced multirate multidimensional DSP algorithms

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Combining extended retiming and unfolding for rate-optimal graph transformation

Journal of VLSI Signal Processing Systems
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs

Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Voltage Assignment with Guaranteed Probability Satisfying Timing Constraint for Real-time Multiproceesor DSP

Journal of VLSI Signal Processing Systems
Verification method of dataflow algorithms in high-level synthesis

Journal of Systems and Software
A new strategy for multiprocessor scheduling of cyclic task graphs

International Journal of High Performance Computing and Networking
Time-constrained loop scheduling with minimal resources

Journal of Embedded Computing - Embeded Processors and Systems: Architectural Issues and Solutions for Emerging Applications
Timing optimization via nest-loop pipelining considering code size

Microprocessors & Microsystems
Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
CellSs: Scheduling techniques to better exploit memory hierarchy

Scientific Programming - High Performance Computing with the Cell Broadband Engine
Variable Partitioning and Scheduling for MPSoC with Virtually Shared Scratch Pad Memory

Journal of Signal Processing Systems
Optimizing scheduling and intercluster connection for application-specific DSP processors

IEEE Transactions on Signal Processing
Retiming multi-rate DSP algorithms to meet real-time requirement

Proceedings of the Conference on Design, Automation and Test in Europe
Parallel programming with data driven model

EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Energy-optimal Batching periods for asynchronous multistage data processing on sensor nodes: foundations and an mPlatform case study

Real-Time Systems
C2FPGA-A dependency-timing graph design methodology

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Loop scheduling is an important problem in parallel processing. The retiming technique reorganizes an iteration; the unfolding technique schedules several iterations together. We combine these two techniques to obtain a static schedule with a reduced average computation time per iteration. We first prove that the order of retiming and unfolding is immaterial for scheduling a data-flow graph (DFG). From this nice property, we present a polynomial-time algorithm on the original DFG, before unfolding, to find the minimum-rate static schedule for a given unfolding factor. For the case of a unit-time DFG, efficient checking and retiming algorithms are presented.