#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1991

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Peng Tu, David A. Padua
- Compiler Optimizations for Scalable Parallel…
- 1993

Array privatization is one of the most e ective transformations for the exploitation of parallelism. In this paper, we present a technique for automatic array privatization. Our algorithm uses data ow analysis of array references to identify privatizable arrays intraprocedurally as well as interprocedurally. It employs static and dynamic resolution to… (More)

- William Blume, Ramón Doallo, +9 authors Peng Tu
- IEEE Computer
- 1996

- Fred C. Chow, Sun Chan, Robert Kennedy, Shin-Ming Liu, Raymond Lo, Peng Tu
- PLDI
- 1997

A new algorithm, SSAPRE, for performing partial redundancy elimination based entirely on SSA form is presented. It achieves optimal code motion similar to lazy code motion [KRS94a, DS93], but is formulated independently and does not involve iterative data flow analysis and bit vectors in its solution. It not only exhibits the characteristics common to other… (More)

- David A. Padua, Rudolf Eigenmann, +4 authors Keith Faigin
- 1992

ion for Inner Loops When the algorithm nds a loop nested inside a loop body, it will recursively call itself on the inner loop. To hide the control ow of an inner loop, we introduce some abstraction and extend the previous de nition from a basic block to a complete loop. We start by de ning the information for one iteration of the loop. De nition 5 Let L be… (More)

- Peng Tu, David A. Padua
- PLDI
- 1995

In this paper, we present an almost-linear time algorithm for constructing Gated Single Assignment (GSA), which is SSA augmented with gating functions at ø-nodes. The gating functions specify the control dependences for each reaching definition at a ø-node. We introduce a new concept of <italic>gating path</italic>, which is path in the control… (More)

- Peng Tu, David A. Padua
- International Conference on Supercomputing
- 1995

In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency is improved by using a backward substitution scheme that performs resolution of assertions on-demand and uses heuristics to limit the number of substitution. The precision is… (More)

- Bill Blume, Rudolf Eigenmann, +8 authors Stephen Weatherford
- 1994

It is the goal of the Polaris project to develop a new parallelizing compiler that will overcome limitations of current compilers. While current parallelizing compilers may succeed on small kernels, they often fail to extract any meaningful parallelism from large applications. After a study of application codes, it was concluded that by adding a few new… (More)

An algorithm for register promotion is presented based on the observation that the circumstances for promoting a memory location's value to register coincide with situations where the program exhibits partial redundancy between accesses to the memory location. The recent SSAPRE algorithm for eliminating partial redundancy using a sparse SSA representation… (More)

- Robert Kennedy, Sun Chan, Shin-Ming Liu, Raymond Lo, Peng Tu, Fred C. Chow
- ACM Trans. Program. Lang. Syst.
- 1999

The SSAPRE algorithm for performing partial redundancy elimination based entirely on SSA form is presented. The algorithm is formulated based on a new conceptual framework, the factored redundancy graph, for analyzing redundancy, and representes the first sparse approach to the classical problem and on methods for its solution. With the algorithm… (More)

- William Blume, Ramón Doallo, +9 authors Peng Tu
- 1996

Multiprocessor computers are rapidly becoming the norm. Parallel workstations are widely available today and it is likely that most PCs in the near future will also be parallel. To accommodate these changes, some classes of applications must be developed in explicitly parallel form. Yet, in order to avoid a substantial increase in software development… (More)