Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

DOI10.1109/TC.1986.1676652zbMath0577.68050MaRDI QIDQ3698306

Publication date: 1986

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

iterative algorithms computer program VLSI architectures algorithm transformations VLSI algorithms Computational models Algorithm partitioning VLSI array algorithm models

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (40)

Double pipelines and fast systolic designs on linear arrays ⋮ Advanced Regular Array Design ⋮ Mapping dynamic programming onto modular linear systolic arrays ⋮ Space-Time Equations for Non-Unimodular Mappings ⋮ The design of optimal planar systolic arrays for matrix multiplication ⋮ Two-dimensional iterative arrays: Characterizations and applications ⋮ Automatic design and partitioning of systolic/wavefront arrays for VLSI ⋮ FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION∗ ⋮ A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS ⋮ A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS† ⋮ MODULAR FIXED-SIZE VLSI ARCHITECTURES FOR GENERAL MULTISPLITTING ITERATION ⋮ Method of constructing parallel forms of algorithms based on locally parallel, globally sequential partition ⋮ A new algorithm for the integer knapsack problem and its parallelization ⋮ Fast linear systolic matrix vector multiplication ⋮ An experimental evaluation of local search heuristics for graph partitioning ⋮ Nonlinear transformations of the matrix multiplication algorithm ⋮ Some complexity results in parallel matrix-based signal processing ⋮ The projection of systolic programs ⋮ Folding transformations for processor arrays ⋮ COMBINING BACKGROUND MEMORY MANAGEMENT AND REGULAR ARRAY CO-PARTITIONING, ILLUSTRATED ON A FULL MOTION ESTIMATION KERNEL ⋮ Decoupling the dimensions of a system of affine recurrence equations ⋮ Algorithm transformations for computational and data broadcast ⋮ From the theory to the tools: parallel dynamic programming ⋮ On high-speed computing with a programmable linear array ⋮ To the role of decomposition strategy in high parallel algorithms ⋮ Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming ⋮ Algorithm transformations for the data broadcast elimination method ⋮ Decomposing polynomial interpolation for systolic arrays ⋮ Designing of processor-time optimal systolic arrays for band matrix-vector multiplication ⋮ Towards systolizing compilation ⋮ Efficient computing methods for parallel processing: An implementation of the Viterbi algorithm ⋮ A parallel algorithm for generating combinations ⋮ A systolic generation of combinations ⋮ Design of parallel algorithms for the single resource allocation problem ⋮ LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS ⋮ THE MAGIC OF INTERLOCKING PROPERTY: FAST SYSTOLIC DESIGN ⋮ Matrix-vector multiplication on a fixed-size linear systolic array ⋮ Computing transitive closure on systolic arrays of fixed size ⋮ 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

This page was built for publication: Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays