V. Phalke and B. Gopinath, Compression-based program characterization for improving cache memory performance, IEEE Transactions on Computers, 46(11):1174--1186, November 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Microarchitectural and Compile-Time Optimizations for.. - Kalamatianos (2000) (1 citation) (Correct)
....of misses becomes E[X] X 8G 0 (min(s; s i ) 2.4) Notice that (2.4) represents the CMG edge weight computed in Fig. 2.2. Cold start misses are not accounted for in (2.4) The S p i p quantity is equivalent to s i . Another approach that measures locality of references is described in [95, 98], where Phalke and Gopinath define the Inter Reference Gap (IRG) for an address as the number of memory references between successive references to that address. An IRG stream for an address in a trace is the sequence of successive IRG values for that address. IRG modeling is important since it ....
....branch prediction with some success. However, a realistic hardware implementation has not yet been described. Another version of the PPM algorithm is described in [141] It has been successfully applied to areas such as data compression [138] file prefetching [142] and cache replacement policies [98]. The PPM predictor computes probabilities for symbols (as is the case with the CWT and the CWT based PPM algorithm) Its corresponding version for conditional branches computes probabilities for branch outcomes, coded as 1 (taken) and 0 (non taken) It provides the next outcome given the past ....
V. Phalke and B. Gopinath. Compression-based Program Characterization for Improving Cache Memory Performance. IEEE Transactions on Computers, 46(11):1187--1201, November 1997. 187
Indirect Branch Prediction using Data Compression Techniques - Kalamatianos, Kaeli (1999) (2 citations) (Correct)
....branch prediction with success. However, a realistic hardware implementation has yet to be shown. Another version of the PPM algorithm is described in [28] That version has been successfully applied to areas such as data compression [27] file prefetching [33] and cache replacement policies [34]. Again, the PPM predictor computes probabilities for symbols (as is the case with the CWT and the CWT based PPM algorithm) Its corresponding version for conditional branches computes probabilities for branch outcomes, coded as 1 (taken) and 0 (non taken) It provides the next outcome given the ....
V. Phalke and B. Gopinath. Compression-based Program Characterization for Improving Cache Memory Performance. IEEE Transactions on Computers, 46(11):1187--1201, November 1997.
A National Trace Collection and Distribution Resource - Flanagan (1998) (Correct)
No context found.
V. Phalke and B. Gopinath, Compression-based program characterization for improving cache memory performance, IEEE Transactions on Computers, 46(11):1174--1186, November 1997.
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