Study on Data Prefetching Techniques for Linked Data Structure Applications
Data Prefetching is a promising solution to hide memory access latency. An application with Linked Data Structure (LDS) aggravates the memory access latency problem. There are quite number of research publications to solve this problem. Helper thread prefetching is a method in which the cache miss of an application is predicted by a thread ahead of actual program execution and masks the memory latency problem. LDS are commonly found in compilers, databases and graphics applications. This paper explores prefetching techniques to improve the performance of LDS applications in Chip Multi-Processor (CMP).