Automatic implementation of affine iterative algorithms: Design flow and communication synthesis
From MaRDI portal
Recommendations
- The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementations
- An automatic parallelization framework for algebraic computation systems
- Communication-Minimal Partitioning and Data Alignment for Affine Nested Loops
- Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
- Automatic derivation and implementation of signal processing algorithms
- Automatic synthesis of FPGA processor arrays from loop algorithms
- Construction of parallel iterative programs in computer algebra systems
Cites work
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
- A unifying lattice-based approach for the partitioning of systolic arrays via LPGS and LSGP
- APEmille
- Dataflow analysis of array and scalar references
- Geometrical tools to map systems of affine recurrence equations on regular arrays
- scientific article; zbMATH DE number 5995471 (Why is no real title available?)
- scientific article; zbMATH DE number 4070258 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 42110 (Why is no real title available?)
- scientific article; zbMATH DE number 1760022 (Why is no real title available?)
- The parallel execution of DO loops
This page was built for publication: Automatic implementation of affine iterative algorithms: Design flow and communication synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950533)
