The Organization of Computations for Uniform Recurrence Equations

Cited In (53)

Automatic synthesis of parallel algorithms
Some applications of combinatorial optimization in parallel computing
A systolic architecture for implementing the arithmetic of cryptographic algorithms on elliptic curves
Computability of recurrence equations
COMBINING BACKGROUND MEMORY MANAGEMENT AND REGULAR ARRAY CO-PARTITIONING, ILLUSTRATED ON A FULL MOTION ESTIMATION KERNEL
Optimal systolic array algorithms for tensor product
Computability of affine non-conditional recurrent systems
Incremental closure for systems of two variables per inequality
Topologically trivial closed walks in directed surface graphs
Powers of matrices over an extremal algebra with applications to periodic graphs
Polynomial time analysis of toroidal periodic graphs
Undecidability of restricted uniform recurrence equations
A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS†
INTERLOCKING PROPERTIES OF THE LINEAR DATA DEPENDENCE METHOD
Total unfolding: theory and applications
Distributing and parallelizing non-canonical loops
Topological rewriting and the geometrization of programming
Algorithm transformations for computational and data broadcast
PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
Array-OL with delays, a domain specific specification language for multidimensional intensive signal processing
Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm
An incremental mechanical development of systolic solutions to the algebraic path problem
Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
Nonlinear transformations of the matrix multiplication algorithm
Minimization of circuit registers: Retiming revisited
Generic systolic arrays: A methodology for systolic design
Reducing off-chip memory access via stream-conscious tiling on multimedia applications
Localized algorithms for vlsi processor arrays
Mapping 3-D IIR digital filter onto systolic arrays
Regularity and firing sequences of computation graphs
Advanced Regular Array Design
REGULAR STATE MACHINES
parallel parsing from recurrence equations
New results on computability of recurrence equations
A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
Systolic SVD and QR Decomposition by Householder Reflections
Parallel program schemata
Geometrical tools to map systems of affine recurrence equations on regular arrays
Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS
Space-Time Equations for Non-Unimodular Mappings
Table design in dynamic programming
Decoupling the dimensions of a system of affine recurrence equations
ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
Some complexity results in parallel matrix-based signal processing
A hierarchical design methodology for full-search block matching motion estimation
Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming
Processor lower bound formulas for array computations and parametric Diophantine systems
On loop transformations of nested loops with affine dependencies
Folding transformations for processor arrays
Some efficient solutions to the affine scheduling problem. I: One- dimensional time
Localization of edges in graph models of two-level algorithms
Algorithm transformations for the data broadcast elimination method

This page was built for publication: The Organization of Computations for Uniform Recurrence Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558285)