K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, Nov. 1999. 3.3.1, 3.3.2, 3.4 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cache Characterization and Performance Studies Using Locality.. - Sorensen (2003) (Correct)
....a new method for synthetic trace creation. All of these proposed methods are based on memory reference locality, which is the de ning characteristic of caches. 3. 1 The Locality Surface Most researchers evaluate locality either as a scalar value [10] 11] or as a series of two dimensional graphs [23] [24] A scalar value oversimpli es locality. A value such as the miss rate may help one understand how a given workload would function in the given cache, but gives little indication how the same workload would function in caches of other sizes or con gurations. There is no one two dimensional ....
Kathryn S. McKinley and Olivier Temam. Quantifying loop nest locality using spec'95 and the perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288-336, November 1999. 15
Phase Analysis of Program Memory Behavior - Kartik Agaram Stephen (Correct)
....sim cache [3] simulator from the SimpleScalar tool suite, and hardware performance monitors [2] These tools have an architectural point of view and do not describe performance problems in terms that are familiar to the programmer s or compiler s view of the program. Several program analysis tools [20, 8, 11, 14] come closer to this view and capture aggregate data structure, procedure, and or loop nesting cache behavior for array programs. They do not, however, examine phase behavior how data structure behavior varies over the execution of the program. These tools also do not analyze dynamically allocated ....
....Section 6 summarizes and suggests further uses of DTrack. 2 Related Work A common method of producing aggregate memory statistics is through simulation, of which we cite a few representative samples [1, 7, 19, 3] More sophisticated cache memory behavior analysis tools have been developed [20, 8, 11, 12, 13, 14], and this section compares DTrack to this prior work. Our work di ers from these tools in that we consider pointer data structures in addition to arrays, and show that aggregate statistics obscure possible optimization opportunities revealed by phase behavior. Of course, the increased detail ....
[Article contains additional citation context not shown here]
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288-336, Nov. 1999.
Design of Conflict and Access Analysis - Lindenmaier (2000) (Correct)
....inherent to a loop: A data item is reused if the same data is used in multiple iterations in a loop nest. Thus reuse is a measure that is inherent in the computation. They de ne locality as utilized reuse . Several other researchers ( Car96] follow this classi cation. Temam and McKinley [MT98, p. 5] exchange the meaning of the two terms. They say References with locality thus have the potential for reuse in the cache. Reuse is simply a hit in the cache that achieves locality. i.e. they de ne locality as a feature inherent to the program, reuse giving the actual program performance ....
....cache that achieves locality. i.e. they de ne locality as a feature inherent to the program, reuse giving the actual program performance with respect to the cache. Di erences also exist in the de nition of spatial and temporal reuse locality. WL91] de ne temporal as a special case of spatial, MT98] de ne them as exclusive features. With the following de nitions we want to clarify the situation, following the terminology of the older reference, but making the clear distinctions between spatial and temporal of [MT98] We also extend the de nitions from loops to the whole program. Data ....
[Article contains additional citation context not shown here]
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. IEEE Transactions on Computer Systems, May 1998. Submitted.
Reuse Distance as a Metric for Cache Behavior - Beyls, D'Hollander (2001) (5 citations) (Correct)
....focus on eliminating conflict misses[3, 5, 9, 11, 13, 15] Only some software techniques such as loop tiling, loop fusion and loop reversal focus on eliminating capacity misses. However, in real programs, such as spec95fp, it has been shown that up to 68 of the cache misses are capacity misses[8]. This is consistent with our own measurements, presented in section 3. In order to gain insight in the origin of cache misses, we propose to measure the stack distance[2] as a metric for data locality in sect. 2. It measures the distance in time between the use and subsequent reuse of the same ....
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288-- 336, Nov. 1999.
Next-Generation Memory Systems - Wang (2004) Self-citation (Mckinley) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, November 1999.
Using the Compiler to Improve Cache Replacement Decisions - Wang, McKinley, Rosenberg, .. (2002) (11 citations) Self-citation (Mckinley) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, Nov. 1999.
Analysis of Profiling Information for Cache Sensitive Scheduling - Lindenmaier (1999) Self-citation (Mckinley) (Correct)
No context found.
Kathryn McKinley and Olivier Temam, \Quantifying Loop Nest Locality Using SPEC'95 and the Perfect Benchmarks", Submitted to ACM Transactions on Computer Systems, 1998
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, Nov. 1999. 3.3.1, 3.3.2, 3.4
Reuse-distance-based Miss-rate Prediction on a Per.. - Fang, Carr, Onder, Wang (2004) (1 citation) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, Nov. 1999.
Cache Behavior Modeling of Codes with Data-Dependent.. - Andrade, Fraguela, Doallo (Correct)
No context found.
McKinley, K.S., Temam, O.: Quantifying Loop Nest Locality Using SPEC'95 and the Perfect Benchmarks. ACM Transactions on Computer Systems 17 (1999) 288-- 336
Power-Aware Compilation Techniques for High Performance Processors - Yang (2004) (Correct)
No context found.
Kathryn S. McKinley and Olivier Temam. Quantifying loop nest locality using SPEC'95 and the perfect benchmarks. ACM Transactions on Computer Systems (TOCS), 17(4):288--336, 1999.
Improving Effective Bandwidth through Compiler Enhancement of.. - Ding, Kennedy (10 citations) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, 1999.
Predicting Whole-Program Locality Through Reuse Distance Analysis - Ding, Zhong (2003) (6 citations) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, 1999.
Compiler-Assisted Cache Replacement: Problem.. - Yang, Govindarajan.. (2003) (3 citations) (Correct)
No context found.
Kathryn S. McKinley and Olivier Temam. Quantifying loop nest locality using spec'95 and the perfect benchmarks. ACM Transactions on Computer Systems (TOCS), 17(4):288--336, 1999.
Improving Data Locality by Array - Yonghong Song Rong (Correct)
No context found.
Kathryn S. McKinley and Olivier Teman. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4), November 1999.
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, Nov. 1999. 3.3.1, 3.3.2, 3.4
Using Locality Surfaces to Characterize the SPECint 2000.. - Sorenson, Flanagan (2000) (Correct)
No context found.
Kathryn S. McKinley and Olivier Temam. Quantifying loop nest locality using spec'95 and the perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288-336, November 1999.
Efficient and Accurate Analytical Modeling of Whole-Program Data .. - Xue, Vera (2003) (Correct)
No context found.
K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288--336, Sept. 1999.
Compiler-Assisted Cache Replacement: Problem.. - Yang, Govindarajan.. (2003) (3 citations) (Correct)
No context found.
Kathryn S. McKinley and Olivier Temam. Quantifying loop nest locality using spec'95 and the perfect benchmarks. ACM Transactions on Computer Systems (TOCS), 17(4):288--336, 1999.
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