Cache Remapping to Improve the Performance of Tiled Algorithms

With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, different forms of tiling are used to keep data at the fastest cache level. However, conflict misses cannot easily be avoided using the current techniques. In this paper cache remapping is presented as a new way to eliminate conflict as well as capacity and cold misses in regular array computations. The method uses advanced cache hints which can be exploited at compile time. The results on a set of typical examples are very favorable and it is shown that cache remapping is amenable to an efficient compiler implementation.

• Type: Conference
• Year: 2000
• Where: EUROPAR
• Authors: Kristof Beyls, Erik H. D'Hollander
• Keywords: Advanced Cache Hints, Cache Remapping, Distributed And Parallel Computing, EUROPAR 2000, Fastest Cache Level