Loading...
Please wait, while we are loading the content...
Similar Documents
Compiler optimizations for massively parallel machines: transformations on iterative spatial loops (1993).
| Content Provider | CiteSeerX |
|---|---|
| Author | Chen, Marina Hu, Yu |
| Abstract | This paper presents a set of compiler optimizations and their application strategies for a common class of data parallel loop nests. The arrays updated in the body of the loop nests are assumed to be partitioned into blocks (rectangular, rows, or columns) where each block is assigned to a processor. These optimizations are demonstrated in the context of a FORTRAN-90 compiler with very encouraging preliminary results. In the case of solving tridiagonal systems by Gaussian Elimination, the performance of the optimized native code is two orders of magnitude better than the CM-FORTRAN compiler and approaching that of the hand-written Connection Machine Scientific Library (CMSSL) routine. 1 Introduction Data distribution and generating efficient communication are recognized as two of the main issues in compiling for massively parallel machines. However, the performance of target code also depends on the efficiency of the sequential code running on each processor. In this paper, we present ... |
| File Format | |
| Publisher Date | 1993-01-01 |
| Access Restriction | Open |
| Subject Keyword | Compiler Optimization Iterative Spatial Loop Massively Parallel Machine Hand-written Connection Machine Scientific Library Efficient Communication Encouraging Preliminary Result Loop Nest Common Class Main Issue Parallel Machine Tridiagonal System Introduction Data Distribution Data Parallel Loop Nest Target Code Fortran-90 Compiler Optimized Native Code Application Strategy Sequential Code Cm-fortran Compiler Gaussian Elimination |
| Content Type | Text |
| Resource Type | Article |
