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

Full description

Bibliographic Details

Published in:	2018 IEEE 25th International Conference on High Performance Computing (HiPC) pp. 52 - 61
Main Authors:	Firoz, Jesun Sahariar, Zalewski, Marcin, Kanewala, Thejaka, Lumsdaine, Andrew
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2018
Subjects:	Approximation algorithms Asynchronous execution Classification algorithms Color Distributed graph algorithms Image color analysis Runtime Synchronization Task analysis
ISSN:	2640-0316
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!