Our results demonstrate that efficient implementations are possible. The implementation of these techniques in HPF is not trivial, and we describe in detail how we propose to solve the problems. We combine strategies that have become popular in message-passing parallel programming, like mesh partitioning and splitting the matrix in local submatrices, with the functionality of HPF and HPF compilers, like the implicit handling of communication and distribution. We propose techniques to handle these problems. Moreover, the limited capabilities of HPF to distribute and align data structures make it hard to implement the desired distributions, or to indicate these such that the compiler recognizes the efficient implementation. The locality in the computations is unclear, and for efficiency we use storage schemes that obscure any structure in the matrix. Writing efficient iterative solvers for irregular, sparse matrices in HPF is hard.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
March 2023
Categories |