@article{ZVMMF_1995_35_6_a10,
author = {V. V. Voevodin},
title = {Macroparallelism and the decomposition of algorithms},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {988--996},
year = {1995},
volume = {35},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_6_a10/}
}
V. V. Voevodin. Macroparallelism and the decomposition of algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 35 (1995) no. 6, pp. 988-996. http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_6_a10/
[1] Polychronopoulus C. D., “Compiler optimizations for enhancing parallelism and their impact on architecture design”, IEEE Trans. Comput., 37:8 (1988), 991–1004 | DOI | MR
[2] Ershov A. P., “Sovremennoe sostoyanie teorii skhem programm”, Probl. kibernetiki, 1973, no. 27, 87–110 | Zbl
[3] Voevodin V. V., Matematicheskie modeli i metody v parallelnykh protsessakh, Nauka, M., 1986
[4] Voevodin V. V., Matematicheskie osnovy parallelnykh vychislenii, Izd-vo MGU, M., 1991
[5] Voevodin V. V., Pakulev V. V., Opredelenie dug grafa algoritma, Preprint No 228, OVM AN SSSR, M., 1989
[6] Voevodin V. V., Voevodin Vl. V., Eremin A. Yu., Tyrtyshnikov E. E., Kompleksnoe izuchenie parallelizma – klyuch k effektivnomu ispolzovaniyu super-EVM, Izd-vo MGU, M., 1994