Asynchronous Distributed Algorithms for Static and Dynamic Directed Rooted Graphs

Asynchronous Distributed Algorithms for Static and Dynamic Directed Rooted Graphs

The paper provides a review of distributed graph algorithms research conducted by authors. We consider an asynchronous distributed system model represented by a strongly connected directed rooted graph with bounded edge capacity (in a sense that only a bounded number of messages can be sent through...

Full description

Bibliographic Details
Main Authors: I. B. Burdonov, A. S. Kossatchev, V. V. Kuliamin, A. N. Tomilin, V. Z. Shnitman
Format: Article
Language:English
Published: Ivannikov Institute for System Programming of the Russian Academy of Sciences 2018-10-01
Series:Труды Института системного программирования РАН
Subjects:
распределенные алгоритмы
асинхронные системы
ориентированный граф
корневой граф
динамический граф
параллельные вычисления
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/454

Similar Items

Similar Items