As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
The explicit inversion of dense matrices appears in a numerous key scientific and engineering applications such as model reduction or optimal control, asking for the exploitation of high performance computing techniques and architectures when the problem dimension is large. Gauss-Jordan elimination (GJE) is an efficient in-place method for matrix inversion that exposes large amounts of dataparallelism, making it very convenient for hardware accelerators such as graphics processors (GPUs) or the Intel Xeon Phi. In this paper, we present and evaluate several practical implementations of GJE, with partial row pivoting, that especially exploit the off-load execution model available on the Intel Xeon Phi to carry out a significant fraction of the computations on the accelerator. Numerical experiments on a system with two Intel Xeon E5-2640v3 processors and an Intel Xeon Phi 7120P compare the efficiency of these implementations, with the most efficient case delivering about 700 billions double-precision floating-point operations per second.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.