Simulations are an essential tool for solving scientific and technical problems. They are based on systems of partial differential equations which lead to regular or irregular meshes. The parallelisation of the solution algorithm is done by a mesh decomposition and a distribution of the submeshes to the processors of the parallel computer. For supporting the programming of parallel computers, the SVM-Fortran programming environment is developed, based on the Shared Virtual Memory concept. SVM-Fortran already provides possibilities for the decomposition of regular meshes, that means that the mesh points may be distributed blocked or cyclic. Based on these techniques, irregular grids are mapped inadequately. Better mappings can be determined with partitioning algorithms which take the connectivity and/or spatial information of the grid points into account. This work presents an overview of the most important partitioning algorithms and describes the language features of SVM-Fortran supporting unstructured meshes. It also outlines the concepts of the implemented runtime system that allows to realise the language features efficiently. (orig.)SIGLEAvailable from FIZ Karlsruhe / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.