Tuncel, MehmetDuran, AhmetCelebi, M. SerdarAkaydin, BoraTopkaya, Figen O.2024-07-182024-07-182016978-0-7354-1438-90094-243Xhttps://doi.org/10.1063/1.4965394https://hdl.handle.net/11411/89462nd International Conference on Numerical Computations - Theory and Algorithms (NUMTA) -- JUN 19-25, 2016 -- Pizzo Calabria, ITALYIn many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2L) problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from LTEMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential Supertti benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.eninfo:eu-repo/semantics/closedAccessConference Object2-s2.0-8499548009110.1063/1.4965394N/A1776N/AWOS:000392692900083