David F. Bacon  Home/Search
Context
Related
| ibm.com/people/d/dfb...Bacon94Thesis.ps 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: ibm.com/people/d/dfb/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Description of Data Structures). The programmer superimposes "dimensions" on the data structure, and then describes distinctness properties for the fields in terms of traversal of the dimensions. Hendren and Nicolau [1990] describe a method for analyzing recursive data structures called path matrix analysis, which keeps track of the access path from one variable to another (e.g., a=b-?left-?right). Paths are expressed using a subset of regular expression notation, and all pairs of variables... (Update)
Active bibliography (related documents): More All
0.5: Increasing Perfect Nests in Scientific Programs - Tarek Abdelrahman And (Correct)
0.4: Abstractions for Recursive Pointer Data Structures.. - Hendren, Hummel, Nicolau (1992) (Correct)
0.4: Automatic Program Parallelization - Banerjee, Eigenmann, Nicolau (1993) (Correct)
Similar documents based on text: More All
0.2: Automatic Pool Allocation for Disjoint Data Structures - Lattner, Adve (2002) (Correct)
0.2: Push vs. Pull: Data Movement for Linked Data Structures - Yang, Lebeck (2000) (Correct)
0.2: Communication Optimizations for Parallel C Programs - Hendren (1998) (Correct)
BibTeX entry: (Update)
@misc{ bacon-optimization,
author = "David F. Bacon",
title = "Optimization of Pointer-Intensive Programs",
url = "citeseer.ist.psu.edu/286374.html" }
Citations (may not include all citations):1575 Computer Architecture: A Quantitative Approach (context) - Hennessy, Patterson - 1990 ACM
252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990 ACM DBLP
230 Limits of instruction-level parallelism - Wall - 1991 ACM DBLP
230 Compiler transformations for high-performance computing - Bacon, Graham et al. - 1993 ACM DBLP
207 Flow analysis and optimization of LISP-like structures (context) - Jones, Muchnick - 1979 ACM DBLP
146 Parallelizing programs with recursive data structures (context) - Hendren, Nicolau - 1990 ACM DBLP
132 Detecting conflicts between structure accesses (context) - Larus, Hilfinger ACM DBLP
99 Dependence analysis for pointer variables (context) - Horwitz, Pfeiffer et al. - 1989
97 Pointer-induced aliasing: A problem classification (context) - Landi, Ryder - 1991 DBLP
92 A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982 ACM DBLP
91 An efficient way to find the side-effects of procedure calls.. (context) - Banning - 1979
82 Limits on multiple instruction issue - Smith, Johnson et al. - 1989
79 Efficient flow-sensitive interprocedural computation of poin.. - Choi, Burke et al. - 1993 ACM DBLP
79 Abstractions for recursive pointer data structures: improvin.. - Hendren, Hummel et al. - 1992
69 Interprocedural modification side effect analysis with point.. - Landi, Ryder et al. - 1993 ACM
68 Interprocedural data flow analysis in the presence of pointe.. - Weihl - 1980
66 Interprocedural side-effect analysis in linear time (context) - Cooper, Kennedy - 1988 ACM DBLP
66 Boosting beyond static scheduling in a superscalar processor - Smith, Lam et al. - 1990
56 The interprocedural analysis and automatic parallelization o.. (context) - Harrison - 1989 ACM DBLP
51 Fast interprocedural alias analysis (context) - Cooper, Kennedy - 1989 DBLP
43 Improving the cache locality of memory allocation - Grunwald, Zorn et al. - 1993
41 Pointer-induced aliasing: a clarification (context) - Marlowe, Landi et al. - 1993 DBLP
26 Restructuring Symbolic Programs for Concurrent Exectution on.. (context) - Larus - 1989
26 Recursive data structures (context) - Hoare - 1975
25 Empirical measurements of six allocation-intensive C program.. - Zorn, Grunwald - 1992 ACM DBLP
25 CustoMalloc: efficient synthesized memory allocators - Grunwald, Zorn - 1993 DBLP
22 Designing programming languages for the analyzability of poi.. - Hendren, Gao - 1993 DBLP
16 Abstract description of pointer data structures: An approach.. (context) - Hummel, Hendren et al. - 1992 DBLP
8 Compiling Lisp programs for parallel execution (context) - Larus - 1991 ACM DBLP
3 Generalized iterations space and the parallelization of symb.. - Harrison - 1991
2 New CPU benchmarks from SPEC (context) - Dixit - 1992
1 expressions for the efficient evaluation of LISP on parallel.. (context) - Harrison, Padua - 1986
Documents on the same site (http://www.research.ibm.com/people/d/dfb/papers.html): More
List of Publications - Bacon (1998) (Correct)
Fallacies of the Multiprocessor Approach to Achieving Large.. - By David Bacon (1995) (Correct)
NEST: A Network Simulation and Prototyping Tool - Bacon, Dupuy, Schwartz, Yemini (1988) (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