Push-up scheduling: Optimal polynomial-time resource constrained scheduling for multi-dimensional applications

Authors:
Nelson Luiz Passos;Edwin Hsing-Mean Sha
Affiliations:
Dept. of Computer Science & Engineering, University of Notre Dame, Notre Dame, IN;Dept. of Computer Science & Engineering, University of Notre Dame, Notre Dame, IN
Venue:
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Year:
1995

Citing 3
Cited 5

Numerical integration of partial differential equations using principles of multidimensional wave digital filters

Journal of VLSI Signal Processing Systems - Parallel processing on VLSI arrays
Loop pipelining for scheduling multi-dimensional systems via rotation

DAC '94 Proceedings of the 31st annual Design Automation Conference
Constructive Methods for Scheduling Uniform Loop Nests

IEEE Transactions on Parallel and Distributed Systems

Fast and extensive system-level memory exploration for ATM applications

ISSS '97 Proceedings of the 10th international symposium on System synthesis
Systematic cycle budget versus system power trade-off: a new perspective on system exploration of real-time data-dominated applications

ISLPED '00 Proceedings of the 2000 international symposium on Low power electronics and design
Low power storage cycle budget distribution tool support for hierarchical graphs

ISSS '00 Proceedings of the 13th international symposium on System synthesis
Multi-dimensional Selection Techniques for Minimizing Memory Bandwidth in High-Throughput Embedded Systems

HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Flow Graph Balancing for Minimizing the Required Memory Bandwidth

ISSS '96 Proceedings of the 9th international symposium on System synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-dimensional computing applications, such as image processing and fluid dynamics, usually contain repetitive groups of operations represented by nested loops. The optimization of such loops, considering processing resource constraints, is required to improve their computational time. This study presents a new technique, called push-up scheduling, able to achieve the shortest possible schedule length in polynomial time. Such technique transforms a multi-dimensional data flow graph representing the problem, while assigning the loop operations to a schedule table in such a way to occupy, legally, any empty spot. The algorithm runs in O(n|E|) time, where n is the number of dimensions of the problem, and |E| is the number of edges in the graph.