Linear programming models for scheduling systems of affine recurrence equations—a comparative study

Authors:
Stephan Balev;Patrice Quinton;Sanjay Rajopadhye;Tanguy Risset
Affiliations:
Institute of Mathematics and Informatics, Acad. G. Bonchev Str. Bl. Bl. 8, room 422, 1113 Sofia, Bulgaria;Irisa, Campus de Beaulieu, 35042 Rennes Cedex, France;Irisa, Campus de Beaulieu, 35042 Rennes Cedex, France;Irisa, Campus de Beaulieu, 35042 Rennes Cedex, France
Venue:
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Year:
1998

On synthesizing systolic arrays from recurrence equations with linear dependencies

Proc. of the sixth conference on Foundations of software technology and theoretical computer science
The systematic design of systolic arrays

Centre National de Recherche Scientifique on Automata networks in computer science: theory and applications
Some efficient solutions to the affine scheduling problem: I. One-dimensional time

International Journal of Parallel Programming
Deriving imperative code from functional programs

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)

A step towards unifying schedule and storage optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)

Hi-index	0.00