Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
C. Lengauer , Fakultat fur Math. und Inf., Passau Univ., Germany
M. Griebl , Fakultat fur Math. und Inf., Passau Univ., Germany
Recently, efforts have been made to devise automatic methods, based on a mathematical model, for the parallelization of loop nests with while loops. These methods are extensions of methods for the parallelization of nested for loops. As we present the theory, the parallelization of a nest of d loops is guaranteed to lay out one loop in time and d-l loops in space (one can trade off additional dimensions from space to time). The spacetime complexity of the target loop nest is equal to the time complexity of the source loop nest (whose space complexity is constant).
parallel programming; programming theory; computational complexity; loop nest parallelization; while loops; automatic methods; mathematical model; nested for loops; time complexity; spacetime complexity; source loop nest; space complexity
C. Lengauer, M. Griebl, "On the parallelization of loop nests containing while loops", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 10, 1995, doi:10.1109/AISPAS.1995.401360