Optimal code parallelization using unimodular transformations

DOI10.1016/0167-8191(90)90055-EzbMath0711.68027OpenAlexW2018201892MaRDI QIDQ922687

Michael L. Dowling

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90055-e

zbMATH Keywords

integer programmingschedulingparallel algorithmsvectorizationmultiprocessingNP- completenessproblem insolubility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Theory of compilers and interpreters (68N20) Distributed algorithms (68W15)

Related Items (3)

A singular loop transformation framework based on non-singular matrices ⋮ Some efficient solutions to the affine scheduling problem. I: One- dimensional time ⋮ Some efficient solutions to the affine scheduling problem. II: Multidimensional time

This page was built for publication: Optimal code parallelization using unimodular transformations