dembanakh / distributed-framework

Simple framework for running distributed algorithms

distributed-framework

A collection of algorithms for Distributed Systems course (winter semester 2020/21) at Jagiellonian University, Theoretical Computer Science Department.

Algorithms

Leader election

Synchronized directed ring

1. Chang-Roberts algorithm
2. Itai-Rodeh algorithm
3. Dolev-Klawe-Rodeh algorithms A and B

Synchronized undirected mesh

1. Peterson algorithm

Synchronized undirected graph

1. YO-YO algorithm

Graph algorithms

Minimum spanning tree

1. Synchronized Gallager, Humblet, and Spira algorithm

Maximal independent set

1. Luby algorithm

Running

Run example:

  go run src/example/synchronized.go 5