During linked data structures(LDS) traversals, prefetching improves the performance by reducingmemory latency. We will discuss about the jump pointer prefetching which hides additional load latencyby using an extra pointer to prefetch objects further than a single link away. Jump pointers can beimplemented in Binary tress by adding jump pointers at creation time and in LDS by adding jumppointers at traversal time. Prefetch Arrays are also used to store jump pointers. It has two approacheshardware and software. Both the approaches have highly improved the performance of prefetchingwith the use of jump pointers. Prefetching in pointer-based codes(java programs) is difficult becauseseparate dynamically allocated objects are disjoint, and the access patterns are thus less regular andpredictable. However, according to experimental results, the largest performance improvement is 48%with jump- pointers in java programs, but consistent improvements are difficult to obtain
展开▼
