Abstract
We present and discuss the parallel implementation of a multi-elimination incomplete LU factorization method for solving sparse linear systems. The proposed solver exploits any available block structure during the factorization, achieving increased throughput during the computation and improved reliability on realistic applications.