Abstract (EN):
Energy consumption is becoming a serious concern in the context of software development. Recent works have shown that energy consumption of an algorithm not only depends on its running-time but also on its number of memory accesses. In this work, we empirically analyse several algorithms for matrix transposition with different patterns of low-level cache access, and compare them in terms of energy consumption and running-time with respect to CPU instructions and memory accesses. Our results suggest that different memory access patterns have a strong influence on the energy consumption and on the cache performance of these algorithms. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
Language:
English
Type (Professor's evaluation):
Scientific
No. of pages:
16