Philippsen M, Mock MU (1994)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 1994
Publisher: Vieweg
Series: Advanced Studies in Computer Science
City/Town: Wiesbaden
Pages Range: 177-191
Conference Proceedings Title: Automatic Parallelization - New Approaches to Code Generation, Data Distribution, and Performance Prediction
Event location: Saarbrücken, Germany
ISBN: 978-3-528-05401-4
URI: http://www2.informatik.uni-erlangen.de/publication/download/Alignment-1.pdf
DOI: 10.1007/978-3-322-87865-6_10
Exploiting locality is a central goal of translating problem-oriented parallel programming languages for distributed memory parallel machines. Modula-2* places the burden of automatically deriving good data and process distribution on the compiler.
In this paper we present a technique implemented in our optimizing compiler that enhances locality in a source-to-source transformation. Analysis of data access patterns and parallel operations leads to an arrangement graph. Processing of this graph reveals conflicting arrangements. Some assumptions and a heuristic based on dynamic programming enables the compiler to find the best alignment in logarithmic time. The technique has improved runtime performance on benchmarks by over 60%.
APA:
Philippsen, M., & Mock, M.U. (1994). Data and process alignment in Modula-2*. In Kessler, C.W. (Eds.), Automatic Parallelization - New Approaches to Code Generation, Data Distribution, and Performance Prediction (pp. 177-191). Saarbrücken, Germany, DE: Wiesbaden: Vieweg.
MLA:
Philippsen, Michael, and Markus U. Mock. "Data and process alignment in Modula-2*." Proceedings of the Intl. Workshop on Automatic Parallelization (AP'93), Saarbrücken, Germany Ed. Kessler, C.W., Wiesbaden: Vieweg, 1994. 177-191.
BibTeX: Download