Distributed Graph Algorithms

A distributed system consists of a number of computational nodes connected by a communication network. The nodes of a distributed system cooperate and communicate to achieve a common goal. We first describe the type of distributed systems, the communication and synchronization methods used in these...

Full description

Saved in:
Bibliographic Details
Published inGuide to Graph Algorithms pp. 117 - 136
Main Author Erciyes, K
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesTexts in Computer Science
Online AccessGet full text
ISBN331973234X
9783319732343
ISSN1868-0941
1868-095X
DOI10.1007/978-3-319-73235-0_5

Cover

More Information
Summary:A distributed system consists of a number of computational nodes connected by a communication network. The nodes of a distributed system cooperate and communicate to achieve a common goal. We first describe the type of distributed systems, the communication and synchronization methods used in these systems. We then investigate few fundamental distributed algorithms including spanning tree construction, broadcast and convergecast operations over a spanning tree, and leader election.
ISBN:331973234X
9783319732343
ISSN:1868-0941
1868-095X
DOI:10.1007/978-3-319-73235-0_5