Improving the Performance of Parallel SpMV Operations on NUMA Systems with Adaptive Load Balancing

  • For a parallel Sparse Matrix Vector Multiply (SpMV) on a multiprocessor, rather simple and efficient work distributions often produce good results. In cases where this is not true, adaptive load balancing can improve the balance and performance. This paper introduces a low overhead framework for adaptive load balancing of parallel SpMV operations. It uses statistical filters to gather relevant runtime performance data and detects an imbalance situation. Three different algorithms were compared that adaptively balance the load with high quality and low overhead. Results show that for sparse matrices, where the adaptive load balancing was enabled, an average speedup of 1.15 (regarding the total execution time) could be achieved with our best algorithm over 4 different matrix formats and two different NUMA systems.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar Availability
Metadaten
Document Type:Part of a Book
Language:English
Parent Title (English):Bassini, Danelutto et al. (Eds.): Parallel computing is everywhere. Advances in Parallel Computing, vol. 32
First Page:445
Last Page:454
ISBN:978-1-61499-842-6
DOI:10.3233/978-1-61499-843-3-445
Publisher:IOS Press
Place of publication:Amsterdam
Publication year:2018
Departments, institutes and facilities:Fachbereich Informatik
Dewey Decimal Classification (DDC):000 Informatik, Informationswissenschaft, allgemeine Werke / 000 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Entry in this database:2018/05/04

$Rev: 12793 $