Synchronization-Avoiding Graph Algorithms

Because they were developed for optimal sequential complexity, classical graph algorithms as found in textbooks have strictly-defined orders of operations. Enforcing a prescribed order of operations, or even an approximate order, in a distributed memory setting requires significant amounts of synchr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2018 IEEE 25th International Conference on High Performance Computing (HiPC) S. 52 - 61
Hauptverfasser:	Firoz, Jesun Sahariar, Zalewski, Marcin, Kanewala, Thejaka, Lumsdaine, Andrew
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.12.2018
Schlagworte:	Approximation algorithms Asynchronous execution Classification algorithms Color Distributed graph algorithms Image color analysis Runtime Synchronization Task analysis
ISSN:	2640-0316
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!