bully-algorithm

Algorithms for implementation of Clock Synchronization, Consistency, Mutual Exclusion, Leader Election

In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes. The process with the highest process ID number from amongst the non-failed processes is selected as the coordinator.

Leader election

This is a java implementation of the distributed computing algorithm, which aims to elect an coordinator or a leader from the nodes active in the computing environment

Implemantation of Distributed Process Coordination Election Algorithim

Distributed Applications Programs based on the college curriculum include practice, practicals, and tests.

A distributed chat application

Implementation of the Bully Algorithm for Distributed Systems in Java.

Project for CS255 Design and Analysis of Algorithms

Educational exploration of distributed-systems as a topic by building a replicated-database as practice.

A distributed chat application

Distributed implementation of the Bully Election Algorithm across multiple servers using Java (JAX-RS/Jersey) and Apache Tomcat, with automated multi-host deployment via SSH

For all Distributed computing code

Distributed Chat Server

Repository of code developed for the course AIAD @FEUP.

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.

High-Availability Java Cluster featuring Bully Algorithm leader election and Stateful Failover. Implements real-time state synchronization to ensure task continuity during node crashes.

The title says everything

This is a compilation of 4 common exercises of distributed programming (ring, bully, readers - writers problem and a simple p2p program) developed in CORBA Java using NetBeans IDE by Juan Carlos Maldonado Lozano and Javier Bernabé García.