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.
Abstractions of components of a distributed system to simulate implementations of distributed algorithms.
Simple Timed I/O Automata Simulator for Distributed Algorithms
A repository for complex networks centrality metrics.
Network Time Protocol clock synchronization algorithm
A simplified, distributed version of the Spanning Tree Protocol for arbitrary layer 2 topologies.
A distributed version of the Bellman-Ford algorithm for calculating routing paths in a network.
Fully distributed orchestration for heterogeneous services
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 Lelann's token-ring algorithm, supporting process failures and insertion/removal of processes.
A distributed Neural Network with synchronous and asynchronous approaches and ring all-reduce implementation
Implementation of some distributed algorithms
Code used in experimental evaluation of distributed Clarkson algorithms for solving LP-type problems
Add a description, image, and links to the distributed-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the distributed-algorithms topic, visit your repo's landing page and select "manage topics."