In summary, the performance of our selective algorithm was affected noticeably in only one of the 13 benchmarks for each parameter we varied. Overall, the algorithm appears to be quite robust.
Now that we have studied our core prefetching algorithm, it is time to ``pop up'' a level conceptually, and examine its interaction with another important technique for coping with the latency of affine array references: locality optimizations.