D.-K. Chen, "Compiler Optimizations for Parallel Loops with Fine-Grained Synchronization ", Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Compiler and Run-Time Support for Irregular Computations - Lain (1995) (8 citations) (Correct)
....by their compiler. In this thesis we are not considering the problem of extracting parallelism at run time, relying instead on compiler directives when static analysis cannot identify parallel loops. Interesting work in this area, mainly for shared address space multiprocessors, is described in [46, 74, 16, 52]. Recently, Rauchwerger [59, 58] proposed a very promising scheme to detect fully parallel loops. This scheme is being implemented in the context of the Polaris compiler project [12] at the University of Illinois. RUN TIME SUPPORT FOR IRREGULAR COMPUTATIONS In order to parallelize applications ....
Ding-Kai Chen. Compiler Optimizations for Parallel Loops with Fine-Grained Synchronizarion. PhD thesis, CSRD, University of Illinois at Urbana-Champaign, 1994.
Increasing Parallelism of Loops with the Loop Distribution.. - Chang, Yang (1995) (Correct)
....depends on the input cases, we can not conclude which one is the best. But, we list the conditions under which our methods are superior to the index shift method. And nally, some conclusions will be given in Section 6. 2 Program Model In this section, we shall rst introduce some terminologies [10, 14, 4, 12] and then de ne the program model we use in this paper. In a parallel program, there are three types of DO loops: serial (DOSER) loops, do all (DOALL) loops and do across (DOACR) loops. Iterations of a DOSER loop must be executed serially, iterations of a DOALL loop can be executed parallelly in ....
....In this paper, we only consider the most common dependence relations, true dependence and antidependence, and only consider the loops whose dependence vectors are all constant. If a dependence distance vector is not a constant vector, we can apply the dependence uniformization technique [11, 4] to make it be uniform. Each loop can be represented by a datadependence graph, shortened as DDG, G = V; A) in which each node represents a statement (an array) and each arc in A represents a dependence relation between two statements. And, each node is associated with a number which is the ....
D. K. Chen, Compiler Optimizations for Parallel Loops with Fine-Grained Synchronization. Ph.D. dissertation, Dep. Comput. Sci. Univ. Illinois at Urbana-Champaign, 1994.
Barrier Synchronisation Optimisation - Stöhr, O'Boyle (Correct)
.... most do not accurately determine whether a dependence requires synchronisation and generally assume a fork and join model [1, 6, 17] Program transformations, such as loop distribution, loop fusion and loop alignment, have also been proposed to eliminate or decrease the cost of synchronisations [3, 4, 18, 2]. More recent work has moved away from the fork and join model and addressed the problem of synchronisation insertion for data parallel languages. Prakash et al. 15] have studied how previous techniques could be targeted to the UC data parallel language. They have proposed runtime methods, such ....
D.-K. Chen, Compiler optimizations for parallel loops with fine-grained synchronization. Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1994
Profiling Dependence Vectors for Loop Parallelization - Shaw-Yen Tseng (1995) (Correct)
....A linear dependence relation usually generates a large number of distinct dependence vectors. An ability to exploit the relationships among these vectors is very important, especially for loop parallelization [10] Recently several techniques aimed at loops with linear dependencies were developed [2, 8, 11]. However these schemes do not deal directly with the relationships among the dependence vectors, and they consider linear dependen This workwas supported in part by the National Science Council under Grant NSC 83 0408 E 007 092 and 84 2213 E 007 014. cies separately from uniform ....
D. Chen. Compiler Optimizations for Parallel Loops with Fine-grained Synchronization. PhD thesis, Dept. of Computer Science, Univeristy of Illinois at Urbana-Champaign, 1994.
Compile Time Barrier Synchronisation Minimisation - O'Boyle, Stöhr (Correct)
No context found.
D.-K. Chen, "Compiler Optimizations for Parallel Loops with Fine-Grained Synchronization ", Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1994.
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