On the performance difference between theory and practice for parallel algorithms

The performance of parallel algorithms is often inconsistent with their preliminary theoretical analyses. Indeed, the difference is increasing between the ability to theoretically predict the performance of a parallel algorithm and the results measured in practice. This is mainly due to the accelera...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of parallel and distributed computing Jg. 138; S. 199 - 210
1. Verfasser: Marowka, Ami
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.04.2020
Schlagworte:
Performance modeling
Python
Quicksort
Teaching parallel programming
Performance modeling
Quicksort
Teaching parallel programming
Python
ISSN:0743-7315, 1096-0848
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The performance of parallel algorithms is often inconsistent with their preliminary theoretical analyses. Indeed, the difference is increasing between the ability to theoretically predict the performance of a parallel algorithm and the results measured in practice. This is mainly due to the accelerated development of advanced parallel architectures, whereas there is still no agreed model for parallel computation, which has implications for the design of parallel algorithms and for the manner in which parallel programming should be taught. In this study, we examined the practical performance of Cormen’s Quicksort parallel algorithm. We determined the performance of the algorithm with different parallel programming approaches and examine the capacity of theoretical performance analyses of the algorithm for predicting the actual performance. This algorithm is used for teaching theoretical and practical aspects of parallel programming to undergraduate students. We considered the pedagogic implications that may arise when the algorithm is used as a learning resource for teaching parallel programming. •Performance analysis of Cormen’s parallel Quicksort algorithm.•Comparing the performance of various implementations of Cormen’s algorithm.•Examination of the theoretical performance prediction of Coremen’s algorithm.
ISSN:0743-7315
1096-0848
DOI:10.1016/j.jpdc.2019.12.020