The Organization of Computations for Uniform Recurrence Equations
From MaRDI portal
Publication:5558285
Cited in
(53)- Algorithm transformations for the data broadcast elimination method
- Computability of recurrence equations
- A systolic architecture for implementing the arithmetic of cryptographic algorithms on elliptic curves
- 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
- Automatic synthesis of parallel algorithms
- Incremental closure for systems of two variables per inequality
- Topologically trivial closed walks in directed surface graphs
- Some applications of combinatorial optimization in parallel computing
- 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
- Topological rewriting and the geometrization of programming
- Distributing and parallelizing non-canonical loops
- An incremental mechanical development of systolic solutions to the algebraic path problem
- Array-OL with delays, a domain specific specification language for multidimensional intensive signal processing
- Algorithm transformations for computational and data broadcast
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
- PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
- Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm
- 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
- Mapping 3-D IIR digital filter onto systolic arrays
- Localized algorithms for vlsi processor arrays
- Regularity and firing sequences of computation graphs
- Advanced Regular Array Design
- REGULAR STATE MACHINES
- parallel parsing from recurrence equations
- A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
- New results on computability of recurrence equations
- 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
- Parallel program schemata
- Systolic SVD and QR Decomposition by Householder Reflections
- LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS
- Decoupling the dimensions of a system of affine recurrence equations
- Table design in dynamic programming
- Space-Time Equations for Non-Unimodular Mappings
- 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
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- On loop transformations of nested loops with affine dependencies
- Folding transformations for processor arrays
- Localization of edges in graph models of two-level algorithms
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)
