Structured Scheduling of Recurrence Equations: Theory and Practice

Authors:
Patrice Quinton;Tanguy Risset
Affiliations:
-;-
Venue:
Embedded Processor Design Challenges: Systems, Architectures, Modeling, and Simulation - SAMOS
Year:
2002

Citing 15
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
LUSTRE: a declarative language for real-time programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Some efficient solutions to the affine scheduling problem: I. One-dimensional time

International Journal of Parallel Programming
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)
Compaan: deriving process networks from Matlab for embedded signal processing architectures

CODES '00 Proceedings of the eighth international workshop on Hardware/software codesign
The parallel execution of DO loops

Communications of the ACM
Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays

IEEE Transactions on Parallel and Distributed Systems
A Loop Transformation Theory and an Algorithm to Maximize Parallelism

IEEE Transactions on Parallel and Distributed Systems
Scheduling Structured Systems

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Revisiting the Decomposition of Karp, Miller and Winograd

ASAP '95 Proceedings of the IEEE International Conference on Application Specific Array Processors
Libraries of schedule-free operators in Alpha

ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
Structuration of the ALPHA language

PMMP '95 Proceedings of the conference on Programming Models for Massively Parallel Computers
Design and evaluation of an environment APE for automatic parallelization of programs

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
On the Analysis and Synthesis of VLSI Algorithms

IEEE Transactions on Computers
Why Systolic Architectures?

Computer

Scalable and structured scheduling

International Journal of Parallel Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present new methods for scheduling structured systems of recurrence equations. We introduce the notion of structured dependence graph and structured scheduling. We show that the scheduling of recurrence equations leads to integer linear programs whose practical complexity is O(n3), where n is the number of constraints. We give new algorithms for computing linear and multi-dimensional structured scheduling, using existing techniques for scheduling non-structured systems of affine recurrence equations. We show that structured scheduling is more than one order of magnitude more efficient than the scheduling of corresponding inlined systems.