Preconditioning index set transformations for time-optimal affine scheduling

Authors:
B. Lisper
Affiliations:
Dept. of Telecommunications and Computer Systems, The Royal Institute of Technology, S-100 44 Stockholm, SWEDEN
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

Citing 9
Cited 1

Spacetime representations of computational structures

Computing
Theory of linear and integer programming

Theory of linear and integer programming
The derivation of systolic implementations

Acta Informatica
The SDEF programming system

Journal of Parallel and Distributed Computing
Synthesis of time-optimal systolic arrays with cells with inner structure

Journal of Parallel and Distributed Computing
Synthesizing synchronous systems by static scheduling in space-time

Synthesizing synchronous systems by static scheduling in space-time
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)
Automatic synthesis of systolic arrays from uniform recurrent equations

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture

Analysis of free schedule in periodic graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.01

Visualization

Abstract