2 papers
cs.DC2017
Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study
Thejaka Kanewala, Marcin Zalewski, Martina Barnas +1
Self-stabilizing algorithms are an important because of their robustness and guaranteed convergence. Starting from any arbitrary state, a self-stabilizing algorithm is guaranteed t…
cs.DC2016
Abstract Graph Machine
Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine
An Abstract Graph Machine(AGM) is an abstract model for distributed memory parallel stabilizing graph algorithms. A stabilizing algorithm starts from a particular initial state and…