https://github.com/rpytel1/distributed-algorithms
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.
https://github.com/rpytel1/distributed-algorithms
distributed-algorithms java-rmi minimum-spanning-trees mutual-exclusion mutual-exclusion-algorithm
Last synced: 3 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/rpytel1/distributed-algorithms
- Owner: rpytel1
- Created: 2018-11-15T10:09:28.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2019-12-01T11:48:23.000Z (over 5 years ago)
- Last Synced: 2025-01-18T06:49:47.614Z (4 months ago)
- Topics: distributed-algorithms, java-rmi, minimum-spanning-trees, mutual-exclusion, mutual-exclusion-algorithm
- Language: Java
- Homepage:
- Size: 281 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 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**.