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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Concurrency and computation Ročník 34; číslo 2
Hlavní autori:	Rehman, Akif, Ahmad, Masab, Khan, Omer
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 25.01.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!