Verteilte-Systeme | SerialPrimeServer

Verteilte-Systeme is a Java library. Verteilte-Systeme has no bugs, it has no vulnerabilities, it has a Strong Copyleft License and it has low support. However Verteilte-Systeme build file is not available. You can download it from GitHub.

SerialPrimeServer.java is a seriell Implementation of a Server, which tests whether a number is a prime number or not. The class SyncPrimeClinet is a Clinet which sends the first ten numbers from 10^18 to the SerialPrimeServer. The clinet waits synchron for the result. PollingPrimeClinet is a client which waits nonblocking for the result from the SerialPrimeServer. The ThreadedPooledPrimeServer provides a thread pool for the requests. The PrimeClinet4ServerMesurement class measures the times of the calculation time of a request to the SerialPrimeServer and the ThreadedPooledPrimeServer. A extension of "1-Aufgabe" with the Posion-Pill-Technique to stop the Server. This project implements the hierarchical localization linear names algorithm. This project implements the algorithm of Ricart and Agrawala for the mutual exclusion in a distributed system. This project implements the bully algorithmen. The bully algorithm is a method in distributed computing for dynamically electing a coordinator by process ID number. The process with the highest process ID number is selected as the coordinator. This project provides the basis for a distributed MVC architecture(Model View Controller).