Task-Queue Based Hybrid Parallelism: A Case Study
Informazioni aggiuntive
Autori
Fürlinger K.,
Schenk O.,
Hagemann M.,
Springer B.
Tipo
Contributo in atti di convegno
Anno
2004
Lingua
Inglese
Sommario
In this paper we report on our experiences with hybrid parallelism in PARDISO, a high-performance sparse linear solver. We start with the OpenMP-parallel numerical factorization algorithm and re-organize it using a central dynamic task queue to be able to add message passing functionality. The hybrid version allows the solver to run on a larger number of processors in a cost effective way with very reasonable performance. A speed-up of more than nine running on a four-node quad Itanium 2 SMP cluster is achieved in spite of the fact that a large potential to minimize MPI communication is not yet exploited in the first version of the implementation.
Titolo atti di convegno
proceedings of the European Conference on Parallel Processing
Editore
Springer Berlin Heidelberg
Nome convegno
Euro-Par 2004: Euro-Par 2004 Parallel Processing
Luogo convegno
Pisa, Italy
Data convegno
August 31, 2004 - September 03, 2004
Pagine (o numero dell’articolo)
624-631
