Vijay S. Pai and Sarita V. Adve. Comparing and combining read miss clustering and software prefetching. In Proceedings of the 2001. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Effective Compile-Time Analysis for Data Prefetching in Java - Cahoon (2002) (Correct)
....reduces execution time by 50 without any prefetching. Our prefetching method with clustering improves performance further, and almost eliminates all memory stalls. Pai and Adve also show that combining prefetching and clustering results in larger improvements than either technique alone [83]. The main disadvantage of clustering is that unroll and jam is difficult to implement, and requires dependence and other related analysis. Our results suggest that advanced prefetch algorithms are not necessary to achieve benefits from prefetching on modern processors. In a superscalar, ....
Vijay S. Pai and Sarita V. Adve. Comparing and combining read miss clustering and software prefetching. In Proceedings of the 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC