Automatic translation of FORTRAN programs to vector form
From MaRDI portal
Publication:3768377
DOI10.1145/29873.29875zbMath0631.68019OpenAlexW2135736783MaRDI QIDQ3768377
Publication date: 1987
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1987-9/
Related Items (19)
A singular loop transformation framework based on non-singular matrices ⋮ Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies ⋮ Beyond unimodular transformations ⋮ Parallelism analysis and optimization in SPEFY, a programming environment ⋮ An algorithm for constructing the basis of the solution set for systems of linear Diophantine equations over the ring of integers ⋮ Properties of data flow frameworks: A unified model ⋮ Efficient SIMD optimization for media processors ⋮ Algorithms for solution of systems of linear Diophantine equations in residue fields ⋮ 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 ⋮ Dataflow analysis of array and scalar references ⋮ Defining conditional independence using collapses ⋮ Combinatorial method for solving systems of linear constraints ⋮ An introduction to compilation issues for parallel machines ⋮ Simple section interchange and properties of non-computable functions ⋮ Loop skewing: the wavefront method revisited ⋮ Static analysis of arithmetical congruences ⋮ Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers ⋮ Some efficient solutions to the affine scheduling problem. II: Multidimensional time
This page was built for publication: Automatic translation of FORTRAN programs to vector form
