Skip to content

Commit

Permalink
Remove todo and move figure
Browse files Browse the repository at this point in the history
  • Loading branch information
lundal committed Apr 3, 2014
1 parent 2eb000c commit 35b9b77
Showing 1 changed file with 3 additions and 5 deletions.
8 changes: 3 additions & 5 deletions report.tex
Original file line number Diff line number Diff line change
Expand Up @@ -65,10 +65,6 @@ \subsection{Global History Buffer}
It maps some key to the most recent element of a linked list.
The IT is based on a FIFO queue like GHB, but significantly smaller as each entry has to be evaluated for each cache miss to look up a matching key.
The key can be based on any cache miss information, and depending on it a wide variety of history based prefetch methods can be implemented.
By keeping only recent data, it is not subject to any significant amount of stale data, and is better able to capture current access patterns.
Programs changing between several regular patterns may however not benefit from this, as one pattern might fill the whole buffer, causing information of the other to be lost.
In a comparison of different prefetch mechanisms by Péres et al.\cite{microlib}, one using GHB gave the best performance.
\todo{less chance for data going stale}

\begin{figure}[!ht]
\centering
Expand All @@ -77,7 +73,9 @@ \subsection{Global History Buffer}
\label{fig:ghb}
\end{figure}


By keeping only recent data, it is not subject to any significant amount of stale data, and is better able to capture current access patterns.
Programs changing between several regular patterns may however not benefit from this, as one pattern might fill the whole buffer, causing information of the other to be lost.
In a comparison of different prefetch mechanisms by Péres et al.\cite{microlib}, one using GHB gave the best performance.

\section{Prefetcher Description}

Expand Down

0 comments on commit 35b9b77

Please sign in to comment.