Optimizing synchronous systems for multi-dimensional applications

Authors:
N. L. Passos;E. H. -M. Sha;Liang-Fang Chao
Affiliations:
Dept. of Computer Science & Eng., University of Notre Dame, Notre Dame, IN;Dept. of Computer Science & Eng., University of Notre Dame, Notre Dame, IN;Dept. of Electrical & Computer Eng., Iowa State University, Ames, Iowa
Venue:
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Year:
1995

Citing 4
Cited 1

Data structures and network algorithms

Data structures and network algorithms
VLSI array processors

VLSI array processors
Constructive Methods for Scheduling Uniform Loop Nests

IEEE Transactions on Parallel and Distributed Systems
Schedule-Based Multi-Dimensional Retiming on Data Flow Graphs

Proceedings of the 8th International Symposium on Parallel Processing

A two-level scheduling method: an effective parallelizing technique for uniform nested loops on a DSP multiprocessor

Journal of Systems and Software - Special issue: Software engineering education and training

Quantified Score

Hi-index	0.00

Visualization

Abstract

Time-critical sections of multi-dimensional problems, such as image processing applications, are in general iterative or recursive. In this paper these sections are modeled us cyclic multi-dimensional data flow graphs (MDFGs), which are also used to represent the digital circuit designed to compute such problems. Each node in the MDFG is associated with a set of functional elements in the circuit. Memory elements and circuit paths are associated with graph edges representing data dependencies. This new optimization technique consists of a multi-dimensional re-timing being applied to the MDFG to reduce its cycle time while considering memory requirements. This technique guarantees that all functional elements of a circuit, designed to be applied to problems involving more than one dimension, can be executed simultaneously. The algorithm runs in O.