This is a two phase commit algorithm implementation on the PeerJS platform.
It uses two files, one for the "leader" which should open first and accepts all the messages and one for all the other nodes.

TODO: merge files (you would need leader election to pick the node-0 one)

This is a Lamport mutual exclusion algorithm implementation on the PeerJS platform.
It's using the Lamport Time algorithm to implement logical clocks.
It utilizes a server "process", which has no role in the algorithm, but is necessary for the shared resource, and enforcing the topology of the network, in a consistent (for all processes) way.

TODO: add more specific info

This is a variation of the LeLann-Chang-Roberts algorithm for leader election in a synchronous, reliable network, that elects k leaders instead of one.
The server was implemented by the CEID Distributed-Systems course professor. No copyright infringement intended.
This algorithm uses raphael.js to display animations.

These were written as part of the CEID Distributed Systems course in 2013
George 'papanikge' Papanikolaou