Distributed Mutual Exclusion based on Lamport's Algorithm

POC Implementation of Mutual Exclusion Algorithm in Distributed Systems

🌐 Implementation of Lamport Clocks 🕒 to Order Life Events in a Distributed System

Leslie Lamport's solution to the Byzantine Generals Problem!

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.

Simulate a Bitcoin-like network (Assignment for COP 701 @ IIT Delhi)

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's Mutual Exclusion Algorithm shown on Dining Philosophers

School project: an implementation of Lamport's distributed mutual exclusion algorithm based on RabbitMQ

Lamport Mutual Exclusion Algorithm Implementation in Java

Example implementation of Lamport's Bakery algorithm for managing multiple threads.

Exercises for course Operation Systems

Distributed Mutex Implementation and performance analysis

A simple implementation of the Lamport-Diffie signature.

A rabbitMQ distributed implementation of Lamport's Algorithm for Mutual Exclusion, written in python 3 using pika rabbitMQ library.

Implementation of Lamport's mutual exclusion algorithm

A demonstration of the OM-algorithm for solving the Byzantine Generals Problem

Lamport cryptocurrency simple