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

Celý popis

Podrobná bibliografia

Vydané v:	2018 IEEE 25th International Conference on High Performance Computing (HiPC) s. 52 - 61
Hlavní autori:	Firoz, Jesun Sahariar, Zalewski, Marcin, Kanewala, Thejaka, Lumsdaine, Andrew
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2018
Predmet:	Approximation algorithms Asynchronous execution Classification algorithms Color Distributed graph algorithms Image color analysis Runtime Synchronization Task analysis
ISSN:	2640-0316
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!