Parallelization of Linearized Applications in Fortran D
نویسندگان
چکیده
The Fortran D language extends Fortran by permitting the user to specify the distribution of array variables across the processors of a parallel computer system. This information can then be used by the compiler to derive a multidimensional parallelization. For programs in which multidimensional arrays have been linearized for optimal performance on vector processors, this strategy will not produce the best results because in those programs Fortran D is limited to a one-dimensional parallelization, which yields less e cient communication than multidimensional parallelization because of surface-to-volume e ects. This paper proposes Fortran D extensions and associated compiler technology to support natural topology parallelization of applications' codes with linearized arrays. Experimental results are presented to illustrate the improvement in performance of this new approach over the performance of currently available methods such as Fortran D and the PARTI inspector/executor strategy.
منابع مشابه
Compiler Support for Machine Independent Parallelization of Irregular Problems Compiler Support for Machine Independent Parallelization of Irregular Problems
The Fortran D group at Rice University aims at providing a machine independent data parallel programming style, in which the applications programmer uses a dialect of sequential Fortran and high level distribution annotations. Extracting parallelism from these applications typically is straightforward, but making eecient use of this par-allelism for irregular applications, such as molecular dyn...
متن کاملAutomatic Parallelization for Distributed - MemorySystems : Experiences
Distributed-memory systems (DMMPs) are powerful tools for solving large-scale sci-entiic and engineering problems. However, these machines are diicult to program since the data must be distributed across the processors and message-passing operations must be inserted for communicating non-local data. In this paper, we discuss the automatic parallelization of Fortran programs for DMMPs, based on ...
متن کاملSimplifying Polynominal Constraints Over Integers to Make Dependence Analysis More Precise
Why do existing parallelizing compilers and environments fail to parallelize many realistic FORTRAN programs? One of the reasons is that these programs contain a number of linearized array references , such as A(M*N*i+N*j+k) or A(i*(i+1)/2+j). Performing exact dependence analysis for these references requires testing polynomial constraints for integer solutions. Most existing dependence analysi...
متن کاملParallelizing Irregular Applications with the Vienna HPF+ Compiler VFC
Applications based on highly irregular, dynamically changing data structures cannot be handled eeciently with current High Performance Fortran and available HPF compilers. In order to support such applications, extensions of the language as well as sophisticated analysis and parallelization techniques are required. In this paper we introduce the Vienna HPF+ Compiler (VFC), a new source-to-sourc...
متن کاملAutomatic Parallelization of C by Means of Language Transcription
The automatic parallelization of C has always been frustrated by pointer arithmetic, irregular control flow and complicated data aggregation. Each of these problems is similar to familiar challenges encountered in the parallelization of more rigidly-structured languages such as FORTRAN. By creating a mapping from one language to the other, we can expose the capabilities of existing automaticall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994