Pages that link to "Item:Q3698306"
From MaRDI portal
The following pages link to Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays (Q3698306):
Displaying 41 items.
- On high-speed computing with a programmable linear array (Q547479) (← links)
- Towards systolizing compilation (Q757032) (← links)
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- Some complexity results in parallel matrix-based signal processing (Q915456) (← links)
- The projection of systolic programs (Q916375) (← links)
- Two-dimensional iterative arrays: Characterizations and applications (Q1102749) (← links)
- Automatic design and partitioning of systolic/wavefront arrays for VLSI (Q1104739) (← 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)
- The design of optimal planar systolic arrays for matrix multiplication (Q1356864) (← links)
- Method of constructing parallel forms of algorithms based on locally parallel, globally sequential partition (Q1364074) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Design of parallel algorithms for the single resource allocation problem (Q1584827) (← links)
- Matrix-vector multiplication on a fixed-size linear systolic array (Q1591991) (← links)
- Designing of processor-time optimal systolic arrays for band matrix-vector multiplication (Q1816677) (← links)
- Efficient computing methods for parallel processing: An implementation of the Viterbi algorithm (Q1825027) (← links)
- A parallel algorithm for generating combinations (Q1825043) (← links)
- A systolic generation of combinations (Q1825668) (← links)
- A new algorithm for the integer knapsack problem and its parallelization (Q1919114) (← links)
- Mapping dynamic programming onto modular linear systolic arrays (Q2365569) (← 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)
- To the role of decomposition strategy in high parallel algorithms (Q2776831) (← links)
- LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS (Q3130158) (← links)
- THE MAGIC OF INTERLOCKING PROPERTY: FAST SYSTOLIC DESIGN (Q3130159) (← links)
- Fast linear systolic matrix vector multiplication (Q4017027) (← links)
- Nonlinear transformations of the matrix multiplication algorithm (Q4032904) (← links)
- Algorithm transformations for computational and data broadcast (Q4375419) (← links)
- From the theory to the tools: parallel dynamic programming (Q4487154) (← links)
- Double pipelines and fast systolic designs on linear arrays (Q4521949) (← links)
- Advanced Regular Array Design (Q4526926) (← links)
- Space-Time Equations for Non-Unimodular Mappings (Q4543519) (← links)
- Decomposing polynomial interpolation for systolic arrays (Q4713422) (← links)
- FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION∗ (Q4819978) (← links)
- A PARALLEL ALGORITHM FOR THE INTEGER KNAPSACK PROBLEM FOR PIPELINE NETWORKS (Q4820099) (← links)
- A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS† (Q4820122) (← links)
- MODULAR FIXED-SIZE VLSI ARCHITECTURES FOR GENERAL MULTISPLITTING ITERATION (Q4820129) (← links)
- Algorithm transformations for the data broadcast elimination method (Q4950621) (← links)
- Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming (Q5950530) (← links)
- Automatic synthesis of parallel algorithms (Q6560204) (← links)
