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/}
}
TY  - JOUR
AU  - Y. V. Kishylau
AU  - N. A. Likhoded
TI  - Changing data array dimensions in parallelized algorithms
JO  - Trudy Instituta matematiki
PY  - 2007
SP  - 27
EP  - 32
VL  - 15
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMB_2007_15_2_a2/
LA  - ru
ID  - TIMB_2007_15_2_a2
ER  - 
%0 Journal Article
%A Y. V. Kishylau
%A N. A. Likhoded
%T Changing data array dimensions in parallelized algorithms
%J Trudy Instituta matematiki
%D 2007
%P 27-32
%V 15
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMB_2007_15_2_a2/
%G ru
%F 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/