Changing data array dimensions in parallelized algorithms
Trudy Instituta matematiki, Tome 15 (2007) no. 2, pp. 27-32
Voir la notice de l'article provenant de la source Math-Net.Ru
The problem of optimization of temporary arrays dimensions is considered in the context of loop nests parallelization. Generalized contraction is introduced and approaches to generalized contraction are described in this work.
@article{TIMB_2007_15_2_a2,
author = {Y. V. Kishylau and N. A. Likhoded},
title = {Changing data array dimensions in parallelized algorithms},
journal = {Trudy Instituta matematiki},
pages = {27--32},
publisher = {mathdoc},
volume = {15},
number = {2},
year = {2007},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMB_2007_15_2_a2/}
}
Y. V. Kishylau; N. A. Likhoded. Changing data array dimensions in parallelized algorithms. Trudy Instituta matematiki, Tome 15 (2007) no. 2, pp. 27-32. http://geodesic.mathdoc.fr/item/TIMB_2007_15_2_a2/