Geodesic
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/

[1] Antonov A.S., Voevodin Vl.V., “Effektivnaya adaptatsiya posledovatelnykh programm dlya sovremennykh vektorno-konveiernykh i massivno-parallelnykh super-EVM”, Programmirovanie, 1996, no. 4, 37–51

[2] Calland P-Y., Darte A., Robert Y., Vivien F., “Plugging anti and output dependence removal techniques into loop parallelization algorithms”, Parallel Computing, 23:1-2 (1997), 251–266 | DOI | Zbl

[3] Akho A., Seti R., Ulman D., Kompilyatory: printsipy, tekhnologii i instrumenty, Izdatelskii dom “Vilyams”, M., 2001

[4] Feautrier P., “Dataflow analysis of scalar and array references”, Int. J. Parallel Programming, 20:1 (1991), 23–52 | DOI

[5] Lim A.W., Liao S.-W., Lam M.S., “Blocking and array contraction across arbitrary nested loops using affine partitioning”, Proceedings of the ACM SIGPLAN Simposium on Principles and Practice of Programming Languages, 2001

[6] Darte A., Huard G., New complexity results on array contractiom and related problems, Research report No 2002-4, LIP, 2002

[7] Adutskevich E.V., Bakhanovich S.V., Likhoded N.A., Affine transformations of loop nests for parallel execution and distribution of data over processors, Preprint No 3 (574), In-t matematiki NAN Belarusi, Minsk, 2005

[8] Likhoded N.A., Bakhanovich S.V., Zherelo A.V., “Poluchenie affinnykh preobrazovanii dlya uluchsheniya lokalnosti gnezd tsiklov”, Programmirovanie, 2005, no. 5, 52–65 | MR | Zbl

[9] Adutskevich E.V., Likhoded N.A., “Soglasovannoe poluchenie konveiernogo parallelizma i raspredeleniya operatsii i dannykh mezhdu protsessorami”, Programmirovanie, 2006, no. 3, 54–65 | MR | Zbl

[10] Adutskevich E.V., Bakhanovich S.V., Likhoded N.A., “Usloviya lokalizatsii dannykh pri posledovatelnoi i parallelnoi realizatsii algoritmov”, Dokl. NAN Belarusi, 50:1 (2006), 34–40 | MR

[11] Adutskevich E.V., Bakhanovich S.V., Likhoded N.A., “Mnogomernoe rasparallelivanie, uchityvayuschee usloviya lokalizatsii dannykh”, Trudy Instituta matematiki, 14:1 (2006), 12–22 | MR