Repository of code developed for the course AIAD @FEUP.
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.
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.
The title says everything
A Java application to share a set of slides and display them in a synchronous way under control of a single node (the leader).
Bully algorithm simulation
Educational exploration of distributed-systems as a topic by building a replicated-database as practice.
A distributed chat application
Project for CS255 Design and Analysis of Algorithms
For all Distributed computing code
Implementation of the Bully Algorithm for Distributed Systems in Java.
Distributed Applications Programs based on the college curriculum include practice, practicals, and tests.
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
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.
Add a description, image, and links to the bully-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the bully-algorithm topic, visit your repo's landing page and select "manage topics."