A distributed inventory system (with multiple "point of sales") that maintains and posts transactions to a distributed ledger across independent nodes using Lamport's Distributed Algorithm.
Example implementation of Lamport's Bakery algorithm for managing multiple threads.
A demonstration of the OM-algorithm for solving the Byzantine Generals Problem
Project for the course of Distributed and Pervasive Systems, University of Milan, M.Sc. in Computer Science, A.Y. 2021/2022. SETA - SElf-driving TA-xi service.
System using mathematical theory of chaos to calculate distributed fractals.
The purpose of this project is to showcase how to implement a message-passing system using Lamport clock time and total ordering of events, with communication among browser windows acting as independent processes.
POC Implementation of Mutual Exclusion Algorithm in Distributed Systems
This project is an implementation of Lamport's Mutual Exclusion Algorithm as in the paper "L. Lamport. Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7):558–565, July 1978"
Lamport Mutual Exclusion Algorithm Implementation in Java
Implementation of the famous dining philosophers problem in a distributed P2P environment using the Ricart-Agrawala algorithm with the Roucairol-Carvalho optimization and Lamport clocks.
Add a description, image, and links to the lamport-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the lamport-algorithm topic, visit your repo's landing page and select "manage topics."