Automatic translation of FORTRAN programs to vector form
From MaRDI portal
Cited in
(19)- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers
- Defining conditional independence using collapses
- An introduction to compilation issues for parallel machines
- Algorithms for solution of systems of linear Diophantine equations in residue fields
- Dataflow analysis of array and scalar references
- Beyond unimodular transformations
- Static analysis of arithmetical congruences
- Simple section interchange and properties of non-computable functions
- Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
- Properties of data flow frameworks: A unified model
- A singular loop transformation framework based on non-singular matrices
- Combinatorial method for solving systems of linear constraints
- An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers
- ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
- Algorithms for solving systems of linear Diophantine equations in residue rings
- Loop skewing: the wavefront method revisited
- Efficient SIMD optimization for media processors
- Parallelism analysis and optimization in SPEFY, a programming environment
This page was built for publication: Automatic translation of FORTRAN programs to vector form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768377)
