distributed-algorithms

Bully distributed leader election algorithm resolving coordinator crashes with rank-priority election messages and answer timeouts.

Bully distributed leader election algorithm resolving coordinator crashes with rank-priority election messages and answer timeouts.

Simple Timed I/O Automata Simulator for Distributed Algorithms

A simplified, distributed version of the Spanning Tree Protocol for arbitrary layer 2 topologies.

A distributed computation primitive based on oblivious projection, local admissibility, and relational state.

Abstractions of components of a distributed system to simulate implementations of distributed algorithms.

Network Time Protocol clock synchronization algorithm

A repository for complex networks centrality metrics.

This repository contains the experiments conducted in the paper: "Distributed Clustering via LSH Based Data Partitioning" (ICML 2018) with synthetic data. This implementation is not a distributed implementation. It is a single machine implementation intended to demonstrate the properties of this technique and approximation results.

A distributed version of the Bellman-Ford algorithm for calculating routing paths in a network.

Implementation of the Mirollo-Strogatz model for Pulse-Coupled Oscillators in Python. Simulates the emergent synchronization of Pteroptyx malaccae fireflies using a toroidal topology and integrate-and-fire mechanisms.

Fully distributed orchestration for heterogeneous services

Implementation of Lelann's token-ring algorithm, supporting process failures and insertion/removal of processes.

m-party perfect-secrecy pad allocation

A collection of parallel machine learning algorithms implemented using MPI for distributed computing, including parallel gradient descent, model evaluation, and K-means clustering.

This project implements three distributed sorting algorithms on a line network using basic primitive operations (send, receive, and compute) in a discrete event simulator using sockets.

Python implementation of distributed wave and election algorithms taught in CSC8103 at Newcastle University

Peer-to-peer lookup protocol

When working with Distributed Systems we want to achieve truly distributed solutions. There might not be a central component that regulates the whole network. Sometimes, however, a system might need to be assigned priority over other systems. In a truly distributed system, the priority of each component is not globally known. Luckily there exist…

Implementation of some distributed algorithms