Chen Ding, Yutao Zhong  Home/Search
Context Related
| rochester.edu/~cding/Docum...pldi03.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rochester.edu/~cding/Documents... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here locality is defined by the distance of data reuse. Studying whole-program data reuse may reveal global patterns not apparent in short-distance reuses or local control flow. However, the analysis must meet two requirements to be useful. The first is efficiency. It needs to analyze all accesses to all data elements in... (Update)
Cited by: More
A Locality-Aware Cooperative Cache Management Protocol to.. - Song Jiang Kei (Correct)
CLOCK-Pro: An Effective Improvement of the CLOCK Replacement - Song Jiang Performance (Correct)
Making LRU Friendly to Weak Locality - Workloads Novel Replacement (Correct)
Active bibliography (related documents): More All
1.3: Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
0.9: Predicting Hierarchical Phases in Program Data Behavior - Xipeng Shen Yutao (Correct)
0.8: Reuse Distance Analysis for Scienti - Programs Yutao Zhong (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Reuse Distance Analysis - Ding, Zhong (2001) (Correct)
0.3: Compiler-Directed Run-Time Monitoring of Program Data Access - Chen Ding Yutao (2002) (Correct)
0.3: Miss Rate Prediction across All Program Inputs - Zhong, Dropsho, Ding (2003) (Correct)
Related documents from co-citation: More All
5: Parametric Analysis of Polyhedral Iteration Spaces - Ph - 1996
4: Analytical computation of Ehrhart polynomials and its applications in compile-ti.. - Seghir, Verdoolaege et al. - 2004
4: A Data Locality Optimizing Algorithm (context) - Wolf, Lam - 1991
BibTeX entry: (Update)
C. Ding and Y. Zhong. Predicting whole-program locality through reuse distance analysis. In Conference on Programming Languages Design and Implementation'03. ACM, 2003. 3.4, 3.4, 4.7 http://citeseer.ist.psu.edu/ding03predicting.html More
@misc{ ding03predicting,
author = "C. Ding and Y. Zhong",
title = "Predicting whole-program locality through reuse distance analysis",
text = "C. Ding and Y. Zhong. Predicting whole-program locality through reuse distance
analysis. In Conference on Programming Languages Design and Implementation'03.
ACM, 2003. 3.4, 3.4, 4.7",
year = "2003",
url = "citeseer.ist.psu.edu/ding03predicting.html" }
Citations (may not include all citations):386 ATOM: A system for building customized program analysis tool.. (context) - Srivastava, Eustace - 1994
192 Self adjusting binary search trees (context) - Sleator, Tarjan - 1985
159 A static performance estimator to guide data partitioning de.. (context) - Balasundaram, Fox et al. - 1991
115 Communication optimizations for irregular scientific computa.. - Das, Uysal et al. - 1994
103 Evaluation techniques for storage hierarchies (context) - Mattson, Gecsei et al. - 1970
93 Aspects of cache memory and instruction buffer performance (context) - Hill - 1987
79 Automatically characterizing large scale program behavior - Sherwood, Perelman et al. - 2002
78 Software---Practice and Experience (context) - Knuth, study et al. - 1971
69 Estimating interlock and improving balance for pipelined mac.. - Callahan, Cocke et al. - 1988
60 Predicting program behavior using real or estimated profiles - Wall - 1991
57 Improving cache performance in dynamic applications through .. - Ding, Kennedy - 1999
51 Improving the ratio of memory operations to floating-point o.. - Carr, Kennedy - 1994
32 The multi-queue replacement algorithm for second level buffe.. - Zhou, Chen et al. - 2001
30 Array SSA form and its use in parallelization - Knobe, Sarkar - 1998
30 A framework for reducing the cost of instrumented code - Arnold, Ryder - 2001
27 An inter-reference gap model for temporal locality in progra.. (context) - Phalke, Gopinath - 1995
19 Quantifying loop nest locality using SPEC'95 and the perfect.. - McKinley, Temam - 1999
19 Efficient representations and abstractions for quantifying a.. - Chilimbi - 2001
17 LIRS: an efficient low inter-reference recency set replaceme.. - Jiang, Zhang - 2002
17 LRU stack processing (context) - Bennett, Kruskal - 1975
15 Dynamic hot data stream prefetching for general-purpose prog.. (context) - Chilimbi, Hirzel - 2002
14 Reuse distance as a metric for cache behavior - Beyls, D'Hollander - 2001
14 Improving Effective Bandwidth through Compiler Enhancement o.. - Ding - 2000
13 Improving memory hierarchy performance for irregular applica.. (context) - Mellor-Crummey, Whalley et al. - 2001
13 Choosing representative slices of program execution for micr.. - Lafage, Seznec - 2000
11 Reuse distance-based cache hint selection - Beyls, D'Hollander - 2002
10 Cache Management by the Compiler (context) - Thabit - 1981
9 Implementing stack simulation for highly-associative memorie.. - Kim, Hill et al. - 1991
9 Multi-configuration simulation algorithms for the evaluation.. (context) - Sugumar, Abraham - 1993
7 Compile-time composition of run-time data and iteration reor.. - Strout, Carter et al. - 2003
7 Optimizing Compilers for Modern Architectures: A Dependence-.. (context) - Allen, Kennedy - 2001
6 Tools for application-oriented performance tuning (context) - Mellor-Crummey, Fowler et al. - 2001
6 Compile-time Performance Prediction of Scientific Programs (context) - Cascaval - 2000
6 Efficient methods for calculating the success function of fi.. (context) - Olken - 1981
5 A compiler approach to fast hardware design space exploratio.. - So, Hall et al. - 2002
5 Workload design: selecting representative program-input pair.. (context) - Eeckhout, Vandierendonck et al. - 2002
5 Calculating stack distances efficiently - Almasi, Cascaval et al. - 2002
3 the predictability of program behavior using different input.. (context) - Hsu, Chen et al. - 2002
3 the stability of temporal data reference profiles - Chilimbi - 2001
3 Reuse distance analysis for scientific programs (context) - Zhong, Ding et al. - 2002
2 An evaluation of the potential benefits of register allocati.. - Li, Gu et al. - 1996
2 Locality optimizations for adaptive irregular scientific cod.. - Han, Tseng - 2000
2 Dynamic memory hierarchy performance and energy optimization (context) - Balasubramonian, Albonesi et al. - 2000
2 Profitability computations on program flow graphs (context) - Cocke, Kennedy - 1974
1 Compiler-directed run-time monitoring of program data access - Ding, Zhong - 2002
Documents on the same site (http://www.cs.rochester.edu/~cding/Documents/Publications/): More
Instruction Balance, Energy Consumption and Program Performance - Li, Ding (2001) (Correct)
Improving Effective Bandwidth through Compiler Enhancement of.. - Ding (2000) (Correct)
Modulo Scheduling with Cache Reuse Information - Ding, Carr, Sweany (1997) (Correct)
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