Outline of the Paper

In Section II, we suggest a useful classification of sequential prefetching algorithms and examine each in detail. In Section III, we provide a formal analysis and proof for the conditions necessary for optimal sequential prefetching. We also provide an implementation called AMP. In Section IV, we describe the workloads used in this paper. In Section V, we delineate the experimental setup used for our experiments. In Section VI, we present the experimental results and conclude with our findings in Section VII.