A performance predictor for implementation selection of parallelized static and temporal graph algorithms

Task‐based execution of graph workloads allows various ordered and unordered implementations, with tasks representing dependencies between graph vertices and edges. This work explores graph algorithms in the context of ordered and unordered task‐based implementations, that trade‐off work‐efficiency...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Concurrency and computation Jg. 34; H. 2
Hauptverfasser:	Rehman, Akif, Ahmad, Masab, Khan, Omer
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc 25.01.2022
Schlagworte:	Algorithms Apexes Graph theory Graphical representations Graphs Neural networks ordered algorithms parallel graph algorithms Performance prediction Prediction models temporal graphs unordered algorithms Variables Workload
ISSN:	1532-0626, 1532-0634
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!