We address the hard question of e cient use on parallel platforms, of incomplete factorization preconditioning techniques for solving large and sparse linear systems by Krylov subspace methods. A novel parallelization strategy based on pseudooverlapped subdomains is explored. This results in e cient parallelizable preconditioners. Numerical results give evidence that high performance can be achieved.