Dévai, Gergely (2015) Lightweight simulation of programmable memory hierarchies Annales Mathematicae et Informaticae. 44. pp. 59-69. ISSN 1787-5021 (Print), 1787-6117 (Online)
![[img]](http://publikacio.uni-eszterhazy.hu/style/images/fileicons/text.png) |
pdf
AMI_44_from59to69.pdf Download (636kB) |
Absztrakt (kivonat)
In most performance critical applications the bottleneck is data access. This problem is mitigated by applying memory hierarchies. There are application domains where the traditional, hard-wired cache control mechanisms are not satisfactory and the programmer is given full control where to place and when to move data. A known optimization technique on these kind of architectures is to do block-transfer of data instead of element-by-element access. This contribution presents a lightweight library, written in and for C, to support experiments with algorithm performance on simulated programmable memory hierarchies. The library provides functions and macros to define memory layers, available block-transfer operations and data layout. The algorithm then can be run on a simple desktop computer and the library combines its real runtime with simulated memory access penalties. Keywords: Memory hierarchy, block transfer, simulation
| Mű típusa: | Folyóiratcikk | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Szerző: |
|
||||||||
| Megjegyzés: | Selected papers of the 9th International Conference on Applied Informatics | ||||||||
| Kapcsolódó URL-ek: | |||||||||
| Nyelv: | angol | ||||||||
| Kötetszám: | 44. | ||||||||
| ISSN: | 1787-5021 (Print), 1787-6117 (Online) | ||||||||
| Felhasználó: | Tibor Gál | ||||||||
| Dátum: | 27 Feb 2019 18:26 | ||||||||
| Utolsó módosítás: | 27 Feb 2019 18:26 | ||||||||
| URI: | http://publikacio.uni-eszterhazy.hu/id/eprint/2981 |
 |
Tétel nézet |
