Using a 0-1 integer programming model for automatic static data distribution
Visualitza/Obre
Cita com:
hdl:2117/331039
Tipus de documentArticle
Data publicació1996-03
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
This paper describes an automatic data distribution method which deal with both the alignment and the distribution problems in a single optimization phase, as opposed to sequentially solving these two inter-dependent approaches as done by previous work. The core of this work is called the Communication-Parallelism Graph, which describes the relationships among array dimensions of the same and different array references regarding communication and parallelism. The overall data distribution problem is then formulated as a linear 0–1 integer programming problem, where the objective function to be minimized is the total execution time. The solution is static in the sense that the layout of the arrays does not change during the execution of the program. We also show the feasibility of using this approach to solve the problem in terms of compilation time and quality of the solutions generated.
CitacióGarcía, J.; Ayguadé, E.; Labarta, J. Using a 0-1 integer programming model for automatic static data distribution. "Parallel processing letters", Març 1996, vol. 6, núm. 1, p. 159-171.
ISSN0129-6264
Versió de l'editorhttp://www.worldscientific.com/doi/abs/10.1142/S0129626496000169
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Using_a_0_1_Integer_Programming_Model_fo.pdf | 114,4Kb | Visualitza/Obre |