D.A.B. Weikle and S.A. McKee and W.A. Wulf. Caches As Filters: A New Approach to Cache Analysis. In International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems, 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....by the presence of the cache [15] Second, the presence of the cache changes the structure of the request arrival process entering the Internet, compared to the request arrival process presented to the cache itself. The first of these two effects has been fairly well studied in the literature [9, 14, 15]. We refer to this work as frequency domain analysis of cache filter effects, since it focuses largely on the frequency distribution of Web docu ment popularity. This document popularity profile typically has a power law structure before the cache, often characterized using a Zipf or a Zipf like ....

.... papers [6, 7, 9] have explicitly addressed the issue of Web cache filter effects, wherein a higher level cache in a multi cache system only handles requests that miss in the lower level cache(s) Similar cache design problems have been addressed previously in the context of CPU cache hierarchies [14], databases [10] and client server systems [16] Among the papers that focus on Web cache filter effects, most focus on the frequency domain aspect of the Web cache filter effect. Doyle et al. 9] refer to this as the trickle down effect, and conduct a detailed simulation study to quantify ....

D. Weikle, S. McKee, and W. Wulf, "Caches as Filters: A New Approach to Cache Analysis", Proceedings of MASCOTS, Montreal, PQ, pp. 2-12, July 1998.

....by the transformations on request streams that commonly occur in the Web: stream aggregation, disaggregation, and filtering. The first two have not been extensively studied before. The third transformation (the stream filtering effects of caches) has recently received some attention. Weikle et al. [19] introduce the view of caches as filters, and compare properties of incoming and outgoing streams of references, in the context of program memory references. In the context of Web caching, Mahanti, Williamson and Eager [9] study how temporal locality changes at different levels in the caching ....

D. Weikle, S. McKee, and W. Wulf, "Caches as filters: A new approach to cache analysis," in 6th Intl. Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '98), July 1998.

....Simplescalar simulations are done using 16 KB of level 1 data cache and 256 KB of level 2 cache parameters. 2.3. Related Work A number of groups have done research in the area of cache performance analysis in recent years. Detailed cache models have been developed by Weikle, McKee, and Wulf in [23] and Sen and Chatterjee in[21] XORbased data layouts to eliminate cache misses have been explored by Valero and others in [10] A number of papers have discussed the optimization of specific dense linear algebra problems with respect to cache performance. Whaley and others discuss optimizing ....

D. A. B. Weikle, S. A. McKee, and Wm.A. Wulf. Caches As Filters: A New Approach To Cache Analysis. In Proc. of Grace Murray Hopper Conference, September 2000.

....to matrix multiply, often transitive closure displays much longer running times. 2.3. Related Work A number of groups have done research in the area of cache performance analysis in implementing algorithms in recent years. Detailed cache models have been developed by Weikle, McKee, and Wulf in [20] and Sen and Chatterjee in [16] Instead of eliminating cache misses, some groups develop methods to tolerate these misses. Multithreading has been discussed as one method of accomplishing this. Kwak and others discuss the effects of multithreading on cache performance in [11] A number of papers ....

D.A.B. Weikle, S. A. McKee, and Wra. A. Wulf. Caches As Filters: A New Approach To Cache Analysis. In Proc. of Grace Murray Hopper Conference, September 2000.

....We assume the pre ordained existence of a caching hierarchy, such as that in [20] and seek to improve its performance. The work is motivated by the observation that the workload characteristics differ across the levels of a caching hierarchy [20] due to filtering effects at lower level caches [30]. This observation suggests the use of different (i.e. heterogeneous) caching policies at different levels of a caching hierarchy. In particular, this paper addresses two questions: In a multi level caching hierarchy, can overall caching performance be improved by using different cache ....

....are available in [9] In general, the child proxy caches have much higher hit ratios than the parent proxy. This observation is not surprising, given that the parent proxy only sees the requests that miss at the lower level caches (i. e, the request stream is filtered by the lower level proxies) [30], 32] Figure 2(a) shows that the GD Size policy at the parent cache provides a significantly better document hit ratio than either LRU or LFU Aging at the parent cache. This document hit ratio advantage is a factor of two or more for most of the cache sizes considered. Furthermore, this ....

D. Weikle, S. McKee, and W. Wulf, "Caches as Filters: A New Approach to Cache Analysis", Proceedings of MASCOTS'98, Montreal, PQ, pp. 2-12, July 1998.

....result section we compare the hit ratios and size of the partitioned cache with the hit ratios and size of the set associative caches. We measure hit ratio of the cache rather than execution time. Modelling the system in this way offers a starting point for strict measures of caching effectiveness [17]. 4 Results We have tested the partitioned cache on a number of programs; the example programs from Section 1, a GIF decoder, a CCITT G.723 audio codec, the Livermore Loops [11] and programs from the RAW [2] benchmark. We present the results for three of these benchmarks below. 4.1 Results for ....

D.A. B. Weikle, S.A. McKee, and Wm.A. Wulf. Caches as filters: A new approach to cache analysis. Proc. Sixth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1998.

....through a simulator to determine hit rates or average memory access times. Occasionally in the past and more often now, researchers are taking a different approach and attempting to design not just a better cache, but better ways to design and analyze caches through new models or measures [1, 3, 5, 7, 8, 9, 12, 13, 14, 16]. This paper describes an analytical framework for cache design. There are four major components that form the framework, each of which is a contribution on its own. First, the TSpec notation is a more formal way for researchers to communicate with clarity about memory references generated by a ....

....Fourth, new metrics provide more insight into cache design than current measures such as hit rate or average memory access time. This last aspect is beyond the scope of this paper, but introduces two new measures, instantaneous hit rate and instantaneous locality. Interested readers should see [16]. 2. Proposed Approach The analysis approach discussed here is inspired by viewing a cache as a filter. As depicted in Figure 1, a cache filters out the references that hit and transforms an input set of references into another, hopefully sparser, output set. Thus, designing memory hierarchies ....

D.A.B. Weikle, S.A. McKee, Wm. A. Wulf. Caches as filters: A new approach to cache analysis. In Proc. of the Sixth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, July, 1998.

....executed them on the simulator. All our simulated caches use a write through allocate policy, optimised write traffic is studied in papers such as [4] We have compare cost (size of the cache) and performance (miss ratio of the cache) as well as instantaneous hit rate and instantaneous locality [5]. First, we ran the benchmarks on the partitioned cache. This gave us the size and performance figures for our partitioned caches. Then we ran the benchmarks on standard caches (direct mapped, set associative, skewed set associative, victim, and column associative caches) The figures for the ....

D. B. Weikle, S. McKee, and W. Wulf. Caches As Filters: A New Approach to Cache Analysis. Proc. Sixth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1998.

....Hybrid and alloyed prediction both reduce wrong history mispredictions, but they may possibly eliminate di#erent wrong history mispredictions. Instantaneous characterizations of prediction streams like the one CHAPTER 8. CONCLUSIONS 190 Weikle et al. proposed for characterizing cache streams [109] might identify simple but localized conditions under which one solution is better than another. Such a technique might also suggest synergistic ways to combine alternative techniques. Yet another interesting direction in which to extend the taxonomy is to include positive e#ects. For example, ....

D. A. B. Weikle, S. A. McKee, and W. A. Wulf. Caches as filters: A new approach to cache analysis. In Proccedings of the Sixth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pages 19--24, July 1998.

No context found.

WEI98 D. A. B. Weikle, S. A. McKee, W. A. Wulf, "Caches As Filters: A New Approach to Cache Analysis", In Sixth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunciation Systems (MASCOTS98), July 19-24, 1998.

....to the authors. Previous work on TSpec, including a description of Tint, a TSpec interpreter that turns TSpec into an address trace is described in [McK97] A general description of the overall framework that uses TSpec, including a description of the cache as filter concept, is included in [Wei98], Wei00a] and [Wei00b] 9. ....

Dee A. B. Weikle, Sally A. McKee, Wm. A. Wulf, "Caches As Filters: A New Approach to Cache Analysis ", Sixth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS'98), July19-24, 1998, Montreal Canada.

....and the effects of cache systems on traces and memory reference patterns. Fourth, new metrics provide more insight into cache design than current measures such as hit rate or average memory access time. Two such metrics instantaneous locality and instantaneous hit rate are introduced elsewhere [Wei98], and have been incorporated them into an interactive tool for rapid visualization of performance traces [Pag99] This framework takes a trace centric approach: a cache filters out trace references that hit, changing an input set of references into another, hopefully sparser, output set. By ....

....steps that point to why a particular cache behavior occurs. In addition, we have a preliminary tool that computes the new measures, displays them in a way that contributes to the user s understanding of the reference string and cache behavior, and allows the user to navigate through the trace [Wei98], and we have experimental tools to automate pattern matching to translate a trace into TSpec. We will soon have a tool to translate a compiler intermediate language to TSpec. Our framework is general in that it is not limited to specific code structures such as loops, for it can accommodate ....

[Article contains additional citation context not shown here]

Dee A. B. Weikle, Sally A. McKee, Wm. A. Wulf, "Caches As Filters: A NewApproach to Cache Analysis", Sixth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '98), July19-24, 1998, Montreal Canada.

No context found.

D.A.B. Weikle and S.A. McKee and W.A. Wulf. Caches As Filters: A New Approach to Cache Analysis. In International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems, 1998.

No context found.

D. Weikle, S. McKee, and W. Wulf, "Caches as Filters: A New Approach to Cache Analysis", Proceedings of MASCOTS'98, Montreal, PQ, pp. 2-12, July 1998.

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