U. Banerjee, R. Eigenmann, A. Nicolau, D. A. Padua, "Automatic program parallelization", Proceedings of the IEEE, Vol. 81, No. 2, 1993, pp.211-243. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
User Transparency: A Fully Sequential Programming Model for.. - Seinstra, Koelma (2004) (Correct)
....tools discussed so far, an efficient automatic parallelizing compiler indeed would constitute an ideal solution. It would allow programmers to develop parallel software by using a sequential high level language without having to learn additional parallel constructs or compiler directives [38]. However, a fundamental problem is that many user defined algorithms contain data dependencies that prevent efficient parallelization. This problem is particularly severe for languages (such as C C ) that support pointers [39] In addition, techniques for automatic dependency analysis and ....
Banerjee U, Eigenmann R, Nicolau A, Padua DA. Automatic program parallelization. Proceedings IEEE 1993; 81(2):211-- 243.
Studies of Integration and Optimization of Interpreted and.. - Fox, Li, Wen, Zhang (1997) (Correct)
.... work on High Performance Java conducted in NPAC has also provided us some insight on parallel execution of Java programs, 35] On the other hand, techniques developed in parallelizing compiler, particularly inter procedural and data flow and dependence analysis related methods[46] 44] [42], may be used to explore implicit parallelism among chunks of code segments. Aside from this, pattern matching methods will be used to recognize some special frames which correspond to pre compiled computational library functions, though maybe executed sequentially. This will be addressed more ....
U. Banerjee, R. Eigenmann, A. Nicolau and D. A. Padna, "Automatic Program Par- allelization", Proceedings of the IEEE, vol, no.2, 1993
Parallelizing Programs Using Access Traces - Nguyen, TAURA, YONEZAWA (Correct)
....successfully detected the parallelism of programs of styles other than divide and conquer style. 1.3 Related work There have been many studies on compile time analysis for parallelizing programs written in various styles. Some focus on loop level parallelism with reg ular array based programs [6, 2, 11, 4], some for divide and conquer ( 18] and recursive procedures ( 9] These methods only work for programs written in the specific style they focus on, and are usually very sensitive to the way programs are written. Our method is not specific to any particular programming style, and is guaranteed ....
....depend on input to the program. Therefore, our approach cannot guarantee an always true solution for every execution. It best suits to be a hint provider for parallelizationchecking tools. We are planning to extend our algorithm with common parallelization idioms such as renaming (privatization) [11, 2]) and locks. By combining techniques of 3.5 3 2.5 2 1.5 1 0.5 Completely random traces Earliest traces x Traces of random memory location Random traces with gradually reducing probability . 3 . 1 2 4 8 16 32 64 128 traces Fig. Number of dependences detected ....
U. Banerjee, R. Eigenmann, A. Nicolau, and D. A.Padua. Automatic Program Parallelization. Proceedings of the IEEE, Volume 81, Number 2, Pages 211-243, February 1993.
Data Compiling for Systems of Affine Recurrence Equations - Mongenet (1994) (Correct)
....the target machine requires the alignment to minimize the communications. The different works in this domain find their foundations both in the systolic synthesis ( 9] 11] 6] 2] 16] 17] 13] and in the loop parallelization techniques ( 12] 10] 21] 5] 19] 20] 4] 8] 18] [1] and the enclosed references) In both studies one deals with problems expressed by systems of recurrence equations or equivalent loop nests. A parallel solution is obtained by applying a space time transformation to the problem. This transformation is characterized by a schedule or timing ....
Banerjee U., Eigenman R., Nicolau A., Padua A., Automatic program parallelization. Proceedings of the IEEE, 81(2), pp. 211-243, 1993.
Dynamic Parallel Media Processing Using Speculative Broadcast.. - Fritts, Wolf (2001) (3 citations) (Correct)
....is of a larger granularity, residing in the outer loops. Consequently, more traditional parallel processing support is needed for data parallelism in multimedia. Extraction of data parallelism for parallel processing requires use of parallel compiler optimizations, as used by multiprocessors [4]. These optimizations take advantage of the parallelism found between separate loop iterations at various loop levels in the program. Those loop iterations found to be independent correspond to data parallel elements in multimedia. High degrees of parallelism can be achieved by scheduling these ....
U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua, "Automatic Program Parallelization," Proceedings of the IEEE, vol. 81, no. 2, February 1993, pp. 211-243.
A Review of Data Placement Optimisation for Data-Parallel.. - Beckmann, Kelly (Correct)
....parallelisation have accordingly also shifted. Distributed memory machines have a high penalty for non local memory access. Accordingly, data placement optimisation has become one of the key tasks an automatic parallelisation system has to address. Survey paper on automatic parallelisation are [6] by Banerjee et al. and [5] by Bacon et al. A survey which focuses more closely on the automatic data placement techniques in such systems is [4] by Ayguad6 et al. There are a number of reasons why solving the parallel data placement problem from an automatic parallelisation approach is harder ....
U. Banerjee, R. Eigenmann, A. Nicolau, and D. A. Padua. Automatic program parallelization. Proceedings of the IEEE, 81(2):211-243, Feb. 1993.
On the Automatic Parallelization of the Perfect.. - Eigenmann, Hoeflinger.. (1998) (17 citations) Self-citation (Eigenmann Padua) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua, "Automatic Program Parallelization," Proc. IEEE, vol. 81, no. 2, pp. 211--243, Feb. 1993.
Symbolic Analysis Techniques For Effective Automatic Parallelization - Blume (1995) (19 citations) Self-citation (Eigenmann) (Correct)
No context found.
Utpal Banerjee, Rudolf Eigenmann, Alexandru Nicolau, and David Padua. Automatic Program Parallelization. Proceedings of the IEEE, 81(2), February 1993.
An Overview of Symbolic Analysis Techniques Needed for the.. - Blume, Eigenmann (1994) (7 citations) Self-citation (Eigenmann) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua. Automatic Program Parallelization. Proceedings of the IEEE, 81(2), February 1993.
Multiplex: Unifying Conventional and Speculative.. - Ooi, Kim, Park.. (2001) (3 citations) Self-citation (Eigenmann) (Correct)
....threads so that each CPU executes the function parallel compute simultaneously. The function includes a pair of loops, where each thread executes a fraction of the loop iterations. The first loop computes and writes to array A. In the second loop, every loop iteration is dependent on the value of A[2] created by CPU0 in the first loop and stored in its L1. The CPUs L1 cache controllers imple FIGURE 1: An example of explicit threading execution. second loop barrier iteration 0 iteration N iteration 2N iteration 3N miss read fill from first loop A[2] A[2] main( ....
....is dependent on the value of A[2] created by CPU0 in the first loop and stored in its L1. The CPUs L1 cache controllers imple FIGURE 1: An example of explicit threading execution. second loop barrier iteration 0 iteration N iteration 2N iteration 3N miss read fill from first loop A[2] A[2] main( fork(parallel compute) parallel compute( serial compute( parallel compute( A[i] A[i] X; barrier( A[2] Y; ment a snoop cache coherence protocol which identifies A[2] s most recent copy to be in CPU0 s L1, and copies it into other CPUs L1s (e.g. CPU1 ....
[Article contains additional citation context not shown here]
U. Banerjee, R. Eigenmann, A. Nicolau, and D. A. Padua. Automatic program parallelization. Proceedings of the IEEE,
The Interaction of Architecture and Compilation.. - Adve, Berger, Eigenmann (1997) (1 citation) Self-citation (Eigenmann) (Correct)
....present additional examples of each type of transformation listed in this taxonomy. 3.1 Static transformations The majority of existing compiler techniques are static optimizations performed once at compile time. They include a large body of established scalar and parallel optimizations [BENP93] that are applied by source to source restructurers and code generating compilers. The following examples discuss several current issues with static optimizations. Load scheduling The common memory system architecture for current machines consists of one or more levels of onchip and or off chip ....
Utpal Banerjee, Rudolf Eigenmann, Alexandru Nicolau, and David Padua. Automatic Program Parallelization. Proceedings of the IEEE, 81(2):211--243, February 1993.
Auto-CFD: Efficiently Parallelizing CFD Applications on Clusters - Li Xiao Xiaodong (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, D. A. Padua, "Automatic program parallelization", Proceedings of the IEEE, Vol. 81, No. 2, 1993, pp.211-243.
Automatic Parallelization of OpenGL Code - Hero (2004) (Correct)
No context found.
et al U Banerjee, R Eigenmann. Automatic program parallelization. Proceedings of the IEEE, pages 211--243, 1993.
Data and Memory Optimization Techniques for Embedded.. - Panda, Catthoor, Dutt, .. (2001) (14 citations) (Correct)
No context found.
BANERJEE, U., EIGENMANN, R., NICOLAU, A., AND PADUA, D. A. 1993. Automatic program parallelization. Proc. IEEE 81, 2 (Feb.), 211--243.
On the Removal of Anti and Output Dependences - Calland, Darte, Robert, Vivien (1997) (Correct)
No context found.
Uptal Banerjee, Rudolph Eigenmann, Alexandru Nicolau, and D.A. Padua. Automatic program parallelization. Proceedings of the IEEE, 81(2):211--243, 1993.
Software Refactoring Guided By Multiple Soft-Goals - Yijun Yu John (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. A. Padua. Automatic program parallelization. Proceedings of the IEEE, 81(2):211--243, feb 1993.
Compiler and Runtime Support for Shared Memory.. - Li, Jin, Agrawal (2002) (Correct)
No context found.
Utpal Banerjee, Rudolf Eigenmann, Alexandru Nicolau, and David A. Padua. Automatic program parallelization. Proceedings of the IEEE, 81(2):211--243, February 1993. In Special Section on Languages and Compilers for Parallel Machines.
Analysis of Multithreaded Programs - Rinard (2001) (13 citations) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua. Automatic program parallelization. Proceedings of the IEEE, 81(2):211--243, Feb. 1993.
Semantic Foundations of Commutativity Analysis - Rinard, Diniz (1996) (1 citation) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua. Automatic program parallelization. Proceedings of the IEEE, 81#2#:211#243, February 1993.
Non-Uniform Dependences Partitioned by Recurrence Chains - Yu, D'Hollander (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. A. Padua. Automatic program parallelization. Proc. of the IEEE, 81(2):211--243, Feb 1993.
User Transparency: A Fully Sequential Programming Model for.. - Seinstra, Koelma (2002) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D.A. Padua. Automatic Program Parallelization. Proceedings of the IEEE, 81(2):211--243, February 1993.
User Transparent Parallel Image Processing - Seinstra (2003) (3 citations) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D.A. Padua. Automatic Program Parallelization. Proceedings of the IEEE, 81(2):211--243, February 1993.
Commutativity Analysis: A New Analysis Framework for.. - Rinard, Diniz (1996) (22 citations) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua. Automatic program parallelization. Proceedings of the IEEE, 81(2):211--243, February 1993.
Software Refactoring Guided By Multiple Soft-Goals - Yijun Yu John (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. A. Padua. Automatic program parallelization. Proceedings of the IEEE, 81(2):211--243, feb 1993.
On the Complexity of Commutativity Analysis - Ibarra, Diniz, Rinard (1996) (2 citations) (Correct)
No context found.
U. Banerjee, R. Eigenmann, A. Nicolau, and D. Padua. Automatic program parallelization. Proceedings of the IEEE, 81#2#:211#243, February 1993.
First 50 documents Next 50
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