SuperLU_MCDT (Many Core Distributed) Solver on MIC Architecture

It is important to have a fast, robust and scalable library to solve a sparse linear system AX=B in many science and engineering applications. In terms of correctness, direct methods are more reliable than iterative counterparts. SuperLU_DIST (see [1]) is a suitable base algorithm for developing a solver. However, it has several weaknesses that diminish its practical performance for certain situations (see [2, 3] and references therein). We (ITU-UHeM) are developing a linear solver SuperLU_MCDT (Many Core Distributed) utilizing the MPI+X hybrid programming model to reduce the communication overhead associated with MPI so that better scalability can be achieved, in addition to other new capabilities. We will customize and test SuperLU_MCDT on EURORA, Eurotech SandyBridge+Intel MIC hybrid cluster of CINECA.[1] X. S. Li, J. W. Demmel, J. R. Gilbert, L. Grigori, M. Shao, I. Yamazaki, SuperLU Users’ Guide, 1999, update: 2012[2] A. Duran, M.S. Celebi, M. Tuncel and B. Akaydin, Design and implementation of new hybrid algorithm and solver on CPU for large sparse linear systems, PRACE, PN:283493, PRACE-2IP white paper, Libraries, WP 43, July 13, 2012[3] M.S. Celebi, A. Duran, M. Tuncel and B. Akaydin, Scalable and improved SuperLU on GPU for heterogeneous systems, PRACE, PN:283493, PRACE-2IP white paper, Libraries, WP 44, July 13, 2012