Push vs. pull: data movement for linked data structures

As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to deliver a high performance computer system. Prefetching can often overlap memory latency with computation for array-based numeric applications. However, prefetching for pointer-intensive applications still remains a challenging problem. Prefetching linked data structures LDS is di cult because the address sequence of LDS traversal does not present the same arithmetic regularity as array-based applications and the data dependence of pointer dereferences can serialize the address generation process. In this paper, we propose a cooperative hardware software mechanism to reduce memory access latencies for linked data structures. Instead of relying on the past address history to predict future accesses, we identify the load instructions that traverse the LDS, and execute them ahead of the actual computation. To overcome the serial nature of the LDS address generation...

• Type: Conference
• Year: 2000
• Where: ICS
• Authors: Chia-Lin Yang, Alvin R. Lebeck
• Keywords: Address Generation, Distributed And Parallel Computing, ICS 2000, Linked Data, Memory Latency