Pour, Farid and Hill, Mark D., "Performance Implications of Tolerating Cache Faults," Computer Sciences Technical Report #991, Univ. of Wisconsin, January 1991. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Performance Implications of Tolerating Cache Faults - Andreas Farid (1991) Self-citation (Farid) (Correct)
....as a brief description of their origins. Due to the large number of traces, we give results only for a combined trace, denoted by all. We constructed the combined trace by alternating the individual traces and cache flushes. For results from two representative individual traces, see Pour and Hill [13]. We only simulate caches smaller than 64K bytes, because the individual traces are not long enough (typically, 400,000 references) to properly exercise larger caches. 4. Results This section presents simulation results for one, two and many faults. Most of the analysis uses the relative miss ....
Pour, Farid and Hill, Mark D., "Performance Implications of Tolerating Cache Faults," Computer Sciences Technical Report #991, Univ. of Wisconsin, January 1991.
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