Abstract
In this paper, we present a parallel multilevel ILU preconditioner implemented with OpenMP. We employ METIS partitioning algorithms to decompose the computation into concurrent tasks, which are then scheduled to threads. Concretely, we combine decompositions which obtain significantly more tasks than processors, and the use of dynamic scheduling strategies in order to reduce the thread’s idle time, which it is shown to be the main source of overhead in our parallel algorithm. Experimental results on a shared-memory platform consisting of 16 processors report remarkable performance for our approach.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
Related conference topics
References
Aliaga, J.I., Bollhoefer, M., Martín, A.F., Quintana-Ortí, E.S.: Parallelization of Multilevel Preconditioners Constructed from Inverse-Based ILUs on Shared-Memory Multiprocessors. In: Bischof, C., et al. (eds.) Parallel Computing: Architectures, Algorithms and Applications, pp. 287–294 (2007)
Aliaga, J.I., Bollhoefer, M., Martín, A.F., Quintana-Ortí, E.S.: Scheduling Strategies for Parallel Sparse Backward/Forward Substitution PARA 2008, Trondheim (2008) (under revision)
Bollhoefer, M.: A Robust ILU Based on Monitoring the Growth of the Inverse Factors. Linear Algebra Appl. 338(1-3), 201–218 (2001)
Bollhoefer, M.: A robust and efficient ILU that incorporates the growth of the inverse triangular factors. SIAM J. Sci. Comput. 25(1), 86–103 (2003)
Bollhoefer, M., Saad, Y.: Multilevel preconditioners constructed from inverse–based ILUs. SIAM J. Sci. Comput. 25(5), 1627–1650 (2006)
Chan, E., Quintana-Ortí, E.S., Quintana-Ortí, G., van de Geijn, R.: SuperMatrix out-of-order scheduling of matrix operations for SMP and multi-core architectures. In: Proceed. 19th ACM SPAA 2007, pp. 116–125 (2007)
Davis, T.: Direct methods for sparse linear systems. SIAM Publications, Philadelphia (2006)
Demmel, W., Gilbert, J.R., Li, X.S.: An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination. SIAM J. Matrix. Anal. Appl. 20(4), 915–952 (1999)
Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998)
Leiserson, C., Plaat, A.: Programming parallel applications in Cilk. SIAM News, SINEWS (1998)
Strakos, Z., Tichy, P.: Error Estimation in Preconditioned Conjugate Gradients. BIT Numerical Mathematics 45, 789–817 (2005)
Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM Publications, Philadelphia (2003)
Saad, Y.: Multilevel ILU with reorderings for diagonal dominance. SIAM J. Sci. Comput. 27(3), 1032–1057 (2005)
Schenk, O., Bollhöfer, M., Römer, R.A.: On Large Scale Diagonalization Techniques for the Anderson Model of Localization. SIAM Review 50(1), 91–112 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aliaga, J.I., Bollhöfer, M., Martín, A.F., Quintana-Ortí, E.S. (2008). Design, Tuning and Evaluation of Parallel Multilevel ILU Preconditioners. In: Palma, J.M.L.M., Amestoy, P.R., Daydé, M., Mattoso, M., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2008. VECPAR 2008. Lecture Notes in Computer Science, vol 5336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92859-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-92859-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92858-4
Online ISBN: 978-3-540-92859-1
eBook Packages: Computer ScienceComputer Science (R0)