(Enter summary)
Abstract: The success of large-scale hierarchical and distributed shared memory systems hinges on our ability to
reduce delays resulting from remote accesses to shared data. To facilitate this, we present a compile-time
algorithm for analyzing programs with doall-style parallelism to determine when read and write accesses to
shared data are redundant (unnecessary). Once identified, redundant remote accesses can be replaced by local
accesses or eliminated entirely. This optimization improves program... (Update)
Context of citations to this paper: More
...algorithm. Our approach is based upon the one devised by Gross and Steenkiste [GS90] and expanded upon by Granston and Veidenbaum [GV91, GV95] This method uses a form of interval analysis to compute the required sets. An interval is a portion of the control flow graph with...
Cited by: More
Compiler-Assisted Checkpoint Optimization Using SUIF - Kingsley, Beck, Plank (1995)
(Correct)
Similar documents (at the sentence level):
30.5%: Detecting Redundant Accesses to Array Data (Extended Version) - Granston, Veidenbaum (1992)
(Correct)
Active bibliography (related documents): More All
0.8: Compile Time Techniques for Using the Priority Data Cache.. - Granston, Veidenbaum (1992)
(Correct)
0.7: Loop Transformations to Prevent False Sharing - Bodin, Granston, Montaut (1995)
(Correct)
0.6: A Framework for Representing Data Parallel Programs and.. - Bordawekar, Choudhary (1995)
(Correct)
Similar documents based on text: More All
0.5: Evaluating Two Loop Transformations for Reducing.. - Bodin, Granston, Montaut (1994)
(Correct)
0.4: The Do-All Problem with Byzantine Processor Failures - Fernandez, Georgiou (2003)
(Correct)
0.4: Page-level Affinity Scheduling for Eliminating False Sharing - Bodin, Granston, Montaut
(Correct)
BibTeX entry: (Update)
E. D. Granston and A. V. Veidenbaum. Combining flow and dependence analyses to expose redundant array accesses. Technical Report 95545, Center for Research on Parallel Computation, May 1995. http://citeseer.ist.psu.edu/granston95combining.html More
@article{ granston95combining,
author = "Elana D. Granston and Alexander V. Veidenbaum",
title = "Combining Flow and Dependence Analyses to Expose Redundant Array Accesses",
journal = "International Journal of Parallel Programming",
volume = "23",
number = "5",
pages = "423--470",
year = "1995",
url = "citeseer.ist.psu.edu/granston95combining.html" }
Citations (may not include all citations):
866
Techniques and Tools (context) - Aho, Sethi et al. - 1986
406
Treadmarks: Distributed Shared Memory On Standard Workstatio..
- Keleher, Dwarkadas et al. - 1994
245
The Omega Test: A Fast and Practical Integer Programming Alg..
- Pugh - 1992
237
Global Optimizations for Parallelism and Locality on Scalabl..
- Anderson, Lam - 1993
149
An Implementation of Interprocedural Bounded Regular Section..
- Havlak, Kennedy - 1991
129
Global Value Numbers and Redundant Computations (context) - Rosen, Wegman et al. - 1988
128
Global Optimization by Suppression of Partial Redundancies (context) - Morel, Renvoise - 1979
114
CRAY TD System Architecture Overview (context) - Research, System et al. - 1993
107
The DASH Prototype: Implementation and Performance (context) - Lenoski, Laudon et al. - 1992
82
To Copy or Not to Copy: A CompileTime Technique for Assessin..
- Temam, Granston et al. - 1993
58
A Mechanism for Keeping Useful Internal Information in Paral.. (context) - Balasundaram - 1990
50
Elimination Algorithms for Data Flow Analysis (context) - Ryder, Paull - 1986
50
Structured Dataflow Analysis for Arrays and Its Use in an Op.. (context) - Gross, Steenkiste - 1990
33
Cedar -- a Large Scale Multiprocessor (context) - Gajski, Kuck et al. - 1983
31
A Compiler-assisted Cache Coherence Solution for Multiproces.. (context) - Veidenbaum - 1986
31
Incremental Dependence Analysis (context) - Rosene - 1990
26
Kendall Square Research Technical Summary (context) - Research - 1992
19
Stale Data Detection and Coherence Enforcement Using Flow An.. (context) - Cheong, Veidenbaum - 1988
18
Automatic Software Cache Coherence Through Vectorization
- Darnell, Mellor-Crummey et al. - 1992
14
Exemplar Architecture (context) - Corporation, Parkway et al. - 1993
8
Loop Transformations to Prevent False Sharing
- Granston, Montaut et al.
7
Computing Communication Sets for Control Parallel Programs (context) - Ferrante, Grunwald et al. - 1994
6
An Overview of Interprocedural Analysis Techniques for High ..
- Schouten - 1989
4
KOAN: A Shared-Memory for the iPSC/2 Hypercube (context) - Lajormi, Priol - 1992
3
Window-Based Register Allocation (context) - Bodin, Jalby et al. - 1991
2
Page-level Affinity Scheduling for Eliminating False Sharing (context) - cois, Elana et al. - 1995
2
Exact Data Dependence Analysis Using Data Access Descriptors (context) - Huelsbergen, Hahn et al. - 1990
2
Automatic Management of Programmable Caches Using Flow Analy.. (context) - Cytron, Karlovsky et al. - 1988
2
Reducing Memory Access Delays in Large-Scale (context) - Granston - 1992
2
A Code Placement Framework and Its Application to Communicat.. (context) - von Hanxleden, Kennedy - 1993
1
A Unified Framework for Optimizing Communication (context) - Gupta, Schonberg et al. - 1994
1
Program Transformation for Locality Using Affinity Regions
- Applebe, Hardnett et al. - 1993
Documents on the same site (http://softlib.rice.edu/CRPC/softlib/TRs_online.html): More
Experiences on Data-Parallel Programming - Clark, von Hanxleden, Kennedy (1994)
(Correct)
A Priori Estimates for Mixed Finite Element.. - Cowsar, Dupont, Wheeler
(Correct)
An Empirical Evaluation of Dependence Analysis in Parallel Program .. - Monk (1995)
(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