Skip to content

Repository for assignments for Distributed Algorithms class at TU Delft. Implemented casual ordering of point-to-point messages (Schiper-Eggli-Sandoz), tokken based mutual exclusion (Singhal’s algorithm) and minimum weight spanning tree in asynchronous networks (Gallager, Humblet, and Spira). All algorithms are written using Java RMI.

Notifications You must be signed in to change notification settings

rpytel1/distributed-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

54 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Distributed-algorithms

This repository contains our implementations on 3 well-known distributed algorithms for the needs of the MSc Distributed Algorithms course in TU Delft. For all the implementations the Java/RMI API was used.

1st Assignment

The first assignment containes our implementation on the Schiper-Eggli-Sandoz algorithm for causal ordering of point-to-point messages.

2nd Assignment

The second assignment containes our implementation on the Singhal’s algorithm for token-based mutual exclusion in a distributed system.

3rd Assignment

The third assignment containes our implementation on the algorithm of Gallager, Humblet, and Spira for creating the Minimum-Weight Spanning Tree of asynchronous weighted networks.

About

Repository for assignments for Distributed Algorithms class at TU Delft. Implemented casual ordering of point-to-point messages (Schiper-Eggli-Sandoz), tokken based mutual exclusion (Singhal’s algorithm) and minimum weight spanning tree in asynchronous networks (Gallager, Humblet, and Spira). All algorithms are written using Java RMI.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages