The Organization of Computations for Uniform Recurrence Equations
From MaRDI portal
Publication:5558285
DOI10.1145/321406.321418zbMath0171.38305OpenAlexW2002252837WikidataQ108828206 ScholiaQ108828206MaRDI QIDQ5558285
Raymond E. Miller, Shmuel Winograd, Richard M. Karp
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321406.321418
Related Items
Advanced Regular Array Design, PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS, REGULAR STATE MACHINES, Systolic SVD and QR Decomposition by Householder Reflections, Generic systolic arrays: A methodology for systolic design, Space-Time Equations for Non-Unimodular Mappings, Undecidability of restricted uniform recurrence equations, A hierarchical design methodology for full-search block matching motion estimation, A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS†, INTERLOCKING PROPERTIES OF THE LINEAR DATA DEPENDENCE METHOD, Powers of matrices over an extremal algebra with applications to periodic graphs, Mapping 3-D IIR digital filter onto systolic arrays, Reducing off-chip memory access via stream-conscious tiling on multimedia applications, Affine scheduling on bounded convex polyhedric domains is asymptotically optimal, Nonlinear transformations of the matrix multiplication algorithm, Unnamed Item, A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems, Distributing and parallelizing non-canonical loops, parallel parsing from recurrence equations, Regularity and firing sequences of computation graphs, Some complexity results in parallel matrix-based signal processing, Folding transformations for processor arrays, Topologically trivial closed walks in directed surface graphs, Topological rewriting and the geometrization of programming, Polynomial time analysis of toroidal periodic graphs, Incremental closure for systems of two variables per inequality, COMBINING BACKGROUND MEMORY MANAGEMENT AND REGULAR ARRAY CO-PARTITIONING, ILLUSTRATED ON A FULL MOTION ESTIMATION KERNEL, ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS, Decoupling the dimensions of a system of affine recurrence equations, Algorithm transformations for computational and data broadcast, Computability of recurrence equations, Some efficient solutions to the affine scheduling problem. I: One- dimensional time, Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming, On loop transformations of nested loops with affine dependencies, 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 the data broadcast elimination method, Table design in dynamic programming, Minimization of circuit registers: Retiming revisited, Parallel program schemata, Localization of edges in graph models of two-level algorithms, NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS, PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS, Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm, Optimal systolic array algorithms for tensor product, LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS, Total unfolding: theory and applications, Localized algorithms for vlsi processor arrays, Computability of affine non-conditional recurrent systems, Synthesis aspects in the design of efficient processor arrays from affine recurrence equations, Geometrical tools to map systems of affine recurrence equations on regular arrays
