|
Title:
|
THE PROCESS OF DESIGNING GPA ALGORITHM COMPILER-BASED PREFETCHING: A REVIEW |
|
Author(s):
|
Nurulhaini Binti Anuar , Norafida Ithnin |
|
ISBN:
|
978-972-8924-56-0 |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Software Prefetching, Recursive Data Structure (RDS), Prefetching Techniques |
|
Type:
|
Short Paper |
|
First Page:
|
426 |
|
Last Page:
|
431 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
There exists a range of algorithm in software prefetching techniques to mask the latency of memory loads. This paper
presents the process of designing GPA algorithm compiler-based prefetching by combining the best existing algorithm
and benchmark with the RDS input programs. We conduct this development through the comparative study and lab
experiments using simic, 500MHz single-issues in-order-scheduled SPARC Processor and Olden benchmark programs.
This compares which critical latency variables from the existing pointer-based prefetching algorithm contributes to the
memory latency performance and that the performance of the latter techniques. We also find that greedy algorithm and
prefetch array algorithm shows the most significant result. |
|
|
|
|
|
|
