Automatic synthesis of parallel algorithms
From MaRDI portal
Publication:6560204
DOI10.1007/BFB0027118zbMATH Open1543.6844MaRDI QIDQ6560204
Lucia Rapanotti, Xian Chen, Graham M. Megson
Publication date: 21 June 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Synthesizing systolic arrays from recurrence equations
- Pipeline architectures for dynamic programming algorithms
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
- Automating non-unimodular loop transformations for massive parallelism
- Parametric integer programming
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Synthesizing linear array algorithms from nested FOR loop algorithms
- The mapping of linear recurrence equations on regular arrays
- THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM
- The parallel execution of DO loops
- Time optimal linear schedules for algorithms with uniform dependencies
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- The Organization of Computations for Uniform Recurrence Equations
This page was built for publication: Automatic synthesis of parallel algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560204)
