Pages that link to "Item:Q5558285"
From MaRDI portal
The following pages link to The Organization of Computations for Uniform Recurrence Equations (Q5558285):
Displaying 50 items.
- An incremental mechanical development of systolic solutions to the algebraic path problem (Q582035) (← links)
- Computability of recurrence equations (Q685372) (← links)
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time (Q687632) (← links)
- A hierarchical design methodology for full-search block matching motion estimation (Q857966) (← links)
- Reducing off-chip memory access via stream-conscious tiling on multimedia applications (Q878118) (← links)
- A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems (Q897394) (← links)
- Some complexity results in parallel matrix-based signal processing (Q915456) (← links)
- Topological rewriting and the geometrization of programming (Q933444) (← links)
- Array-OL with delays, a domain specific specification language for multidimensional intensive signal processing (Q993451) (← links)
- Minimization of circuit registers: Retiming revisited (Q1003739) (← links)
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739) (← links)
- Regularity and firing sequences of computation graphs (Q1159465) (← links)
- Decoupling the dimensions of a system of affine recurrence equations (Q1187518) (← links)
- Synthesis aspects in the design of efficient processor arrays from affine recurrence equations (Q1322844) (← links)
- Geometrical tools to map systems of affine recurrence equations on regular arrays (Q1323382) (← links)
- Powers of matrices over an extremal algebra with applications to periodic graphs (Q1366320) (← links)
- Localization of edges in graph models of two-level algorithms (Q1582914) (← links)
- Computability of affine non-conditional recurrent systems (Q1606914) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- Undecidability of restricted uniform recurrence equations (Q1901700) (← links)
- Mapping 3-D IIR digital filter onto systolic arrays (Q1911473) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Table design in dynamic programming (Q2509355) (← links)
- Parallel program schemata (Q2540014) (← links)
- Optimal systolic array algorithms for tensor product (Q2572702) (← links)
- Folding transformations for processor arrays (Q2710742) (← links)
- COMBINING BACKGROUND MEMORY MANAGEMENT AND REGULAR ARRAY CO-PARTITIONING, ILLUSTRATED ON A FULL MOTION ESTIMATION KERNEL (Q2730099) (← links)
- LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS (Q3130158) (← links)
- Nonlinear transformations of the matrix multiplication algorithm (Q4032904) (← links)
- ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS (Q4366895) (← links)
- Algorithm transformations for computational and data broadcast (Q4375419) (← links)
- Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm (Q4489982) (← links)
- Localized algorithms for vlsi processor arrays (Q4511614) (← links)
- Advanced Regular Array Design (Q4526926) (← links)
- PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS (Q4526929) (← links)
- REGULAR STATE MACHINES (Q4526933) (← links)
- Systolic SVD and QR Decomposition by Householder Reflections (Q4531358) (← links)
- Space-Time Equations for Non-Unimodular Mappings (Q4543519) (← links)
- Polynomial time analysis of toroidal periodic graphs (Q4632455) (← links)
- Total unfolding: theory and applications (Q4764611) (← links)
- A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS† (Q4820122) (← links)
- INTERLOCKING PROPERTIES OF THE LINEAR DATA DEPENDENCE METHOD (Q4820147) (← links)
- parallel parsing from recurrence equations (Q4870969) (← links)
- Algorithm transformations for the data broadcast elimination method (Q4950621) (← links)
- Generic systolic arrays: A methodology for systolic design (Q5044777) (← links)
- NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS (Q5248978) (← links)
- PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS (Q5248983) (← links)
- (Q5869338) (← links)
- Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming (Q5950530) (← links)
- On loop transformations of nested loops with affine dependencies (Q5950531) (← links)
