Optimizations Peng Wu Paul Feautrier David Padua Zehra Sura Department of...  Home/Search
Context
Related
| uiuc.edu/reports/1585.ps.gz 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: uiuc.edu/polaris/rep2 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: If Java is to be used for high performance computing, we must enable classical loop optimizations as well as eliminate those features of Java which are detrimental to good performance, like systematic exception checking. To this end, we have to relate, as precisely as possible, references to physical heap arrays. In this paper, we propose an element-wise points-to analysis for Java references. Our analysis is based on a new abstraction, the element-wise points-to mapping (ewpt ), which maps any ... (Update)
Active bibliography (related documents): More All
0.5: Analyzing Java Arrays: Combness and Synchness Analysis - Peng Wu Paul (Correct)
0.1: Optimizing Java Programs in the Presence of Exceptions - Gupta, Choi, Hind (2000) (Correct)
0.1: Instruction Scheduling in the Presence of Java's Runtime .. - Arnold, Hsiao, Kremer.. (1999) (Correct)
Similar documents based on text: More All
0.2: Programming the FlexRAM Intelligent Memory Architecture - Fraguela, Renau.. (Correct)
0.1: Containers on the Parallelization of General-purpose Java.. - Peng Wu David (1999) (Correct)
0.1: Storage Management in Parallel Programs - Lefebvre, Feautrier (1996) (Correct)
BibTeX entry: (Update)
@misc{ wu-pointsto,
author = "Optimizations Peng Wu",
title = "Points-to Analysis for Java with Applications to Loop",
url = "citeseer.ist.psu.edu/624377.html" }
Citations (may not include all citations):252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
245 The omega test: A fast and practical integer programming alg.. - Pugh - 1991
228 Points-to analysis in almost linear time - Steensgaard - 1996
207 Flow analysis and optimization of lisp-like structures (context) - Jones, Muchnick - 1981
154 Escape analysis for java - Choi, Gupta et al. - 1999
146 Parallelizing programs with recursive data structures (context) - Hendren, Nicolau - 1990
132 Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988
92 A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982
79 Efficient flow-sensitive interprocedural computation of poin.. - Choi, Burke et al. - 1993
72 Putting pointer analysis to work - Ghiya, Hendren - 1998
49 A general data dependence test for dynamic (context) - Hummel, Hendren et al. - 1994
43 Abcd: Eliminating array bounds checks on demand - Bodik, Gupta et al. - 2000
39 Modular interprocedural pointer analysis using access paths:.. - Cheng, mei et al. - 2000
36 Interprocedural may alia analysi pointerbeyond k limiting (context) - Interprocedural, analysis et al. - 1994
34 From flop to megaflops: Java for technical computing - Moreira, Midkiff et al. - 1998
12 Dependence analysis for java - Chambers, Pechtchanski et al. - 1999
2 Contextsensitive intrerprocedural points-to ananlysis in the.. (context) - Emami, Ghiya et al. - 1994
Documents on the same site (http://polaris.cs.uiuc.edu/polaris/rep2.html): More
Polaris: The Next Generation in Parallelizing Compilers - Blume, Eigenmann.. (1994) (Correct)
The Privatizing DOALL Test: A Run-Time Technique for DOALL.. - Rauchwerger, Padua (1994) (Correct)
Parallelization in the Presence of Generalized Induction.. - Pottenger, Eigenmann (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