Please use this identifier to cite or link to this item:
|Title:||Prefetching by self-contained variables - a generalization from array to recursive data structures|
|Citation:||Chan, Wai-wai,Chi, Chi-hung (1997). Prefetching by self-contained variables - a generalization from array to recursive data structures. Aizu International Symposium on Parallel Algorithms/Architecture Synthesis : 225-232. ScholarBank@NUS Repository.|
|Abstract:||Data prefetching has been proven to be effective in hiding the memory latency from the program execution time. Most current data prefetching schemes target only for array references with constant strides. For array references with non-constant strides, they lose most of their effectiveness. In this paper, we propose a novel data prefetching scheme based on a property, called the Self-Containness of Variables, which is widely available in most loop-rich applications. We observed that the update pattern of a self-contained variable in a loop can be accurately predicted. The predicated value can then be used for accurate data prefetching if the variable is the only loop-variant component of an address expression in a memory access instruction. With suitable hardware support, this scheme can be used to prefetch data from recursive data structures in additional to array elements. Moreover, the coverage of this scheme is highly selectable. It can be customized easily to fit the cost-performance requirements of different processors that are designed for different applications.|
|Source Title:||Aizu International Symposium on Parallel Algorithms/Architecture Synthesis|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 14, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.