Synthesizing linear array algorithms from nested FOR loop algorithms
From MaRDI portal
Recommendations
- Refinement based techniques for mapping nested loop algorithms onto linear systolic arrays
- scientific article; zbMATH DE number 426143
- Solving linear systems of equations
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- A methodology for algorithm regularization and mapping into time-optimal VLSI arrays
Cited in
(13)- A methodology for algorithm regularization and mapping into time-optimal VLSI arrays
- Localization of edges in graph models of two-level algorithms
- Mapping dynamic programming onto modular linear systolic arrays
- LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS
- Refinement based techniques for mapping nested loop algorithms onto linear systolic arrays
- Mapping Homogeneous Graphs on Linear Arrays
- scientific article; zbMATH DE number 1330074 (Why is no real title available?)
- Aligators for Arrays (Tool Paper)
- Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming
- Automatic synthesis of parallel algorithms
- Towards systolizing compilation
- Computing transitive closure on systolic arrays of fixed size
- The projection of systolic programs
This page was built for publication: Synthesizing linear array algorithms from nested FOR loop algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3814800)