Logo image
Back
Priority-driven active data prefetching
Conference proceeding

Priority-driven active data prefetching

M Zhu, H Narravula, C Katsinis and D Hecht
18th International Parallel and Distributed Processing Symposium, 2004. Proceedings
2004
DOI: https://doi.org/10.1109/IPDPS.2004.1303322

Abstract

Application software Computer aided instruction Concurrent computing Delay Distributed computing Engines Prefetching Processor scheduling Runtime Yarn
Summary form only given. Data cache misses reduce the performance of wide-issue processors by stalling the data supply to the processor. It is especially worse in the DSM environment. Prefetching data for the critical data address misses is one way to tolerate the cache miss latencies. But current applications with irregular access patterns make it difficult to prefetch data sufficiently early to mask large cache miss latencies, especially in multithreaded applications. To complement prefetching in a multithreaded environment, this paper proposes an approach to prefetch data addresses by a priority-driven method. The method introduced in this paper is a novel approach for dynamically identifying and precompiling the data addresses of the instructions marked as in a higher priority critical path of an application. The critical path can be identified at compile-time or run-time. A separate engine calculates the data addresses of the identified instructions in the critical path and prefetches early enough, the data that are used in the next critical instruction. Preliminary results show that a priority-driven prefetching is useful. It reduces the completion time of an application significantly. The approach improved the overall performance in three experiments conducted with active prefetching, over traditional prefetching, especially in the matrix-matrix multiplication, in our simulator.

Metrics

12 Record Views

Details

Logo image