Geodesic
Visualization and analysis of memory access profile
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 8 (2011), pp. 76-84
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Most applications in every object domain require memory access analysis for getting efficient realization. In this paper a research of memory access profile is made with the use of several typical applications as an example. Based on this research and using visualization, an analysis of possible applications features is made and some general regularities are marked out. Some examples of memory access profile visualization are made for illustrating stated features.
Keywords: efficiency research, typical algorithmic structures, memory access profile, memory access characteristics, profile visualization. 
@article{VYURU_2011_8_a8,
     author = {Vad. V. Voevodin},
     title = {Visualization and analysis of memory access profile},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matemati\v{c}eskoe modelirovanie i programmirovanie},
     pages = {76--84},
     year = {2011},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURU_2011_8_a8/}
}
TY  - JOUR
AU  - Vad. V. Voevodin
TI  - Visualization and analysis of memory access profile
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
PY  - 2011
SP  - 76
EP  - 84
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/VYURU_2011_8_a8/
LA  - ru
ID  - VYURU_2011_8_a8
ER  - 
%0 Journal Article
%A Vad. V. Voevodin
%T Visualization and analysis of memory access profile
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
%D 2011
%P 76-84
%N 8
%U http://geodesic.mathdoc.fr/item/VYURU_2011_8_a8/
%G ru
%F VYURU_2011_8_a8
Vad. V. Voevodin. Visualization and analysis of memory access profile. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 8 (2011), pp. 76-84. http://geodesic.mathdoc.fr/item/VYURU_2011_8_a8/

[1] Vad. V. Voevodin, “Kharakteristiki tipovykh algoritmicheskikh struktur”, Vestnik NNGU, 2011, no. 2, Mart–aprel (to appear)

[2] Vad. V. Voevodin, “Kharakteristiki raboty s pamyatyu i effektivnost raboty programm”, Vysokoproizvoditelnye parallelnye vychisleniya na klasternykh sistemakh, Materialy Kh Mezhdunarodnoi konferentsii HPC-2010 (Perm, 2010), 114–118

[3] V. V. Voevodin, Vychislitelnaya matematika i struktura algoritmov, Izd-vo MGU, M., 2006, 112 pp.

[4] (data obrascheniya 9.02.2011) http://acumem.com

[5] A. A. Korzh, “Otsenochnoe testirovanie sovremennykh sistem i postanovka zadachi razrabotki superkompyuterov s perspektivnoi arkhitekturoi”, dokl., Nauchnyi seminar Parallel.ru, NIVTs MGU, 2008 (data obrascheniya 9.02.2011) http://agora.guru.ru/parallel/files/MemoryWall-1_22-12-08.zip

[6] (data obrascheniya 9.02.2011) http://www.vampir.eu/