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...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 34; no. 2
Main Authors:	Rehman, Akif, Ahmad, Masab, Khan, Omer
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 25.01.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!