Chang Roberts Election Algoritm in C++ with asio(without boost)

I want to simulate the chang roberts election algorithm in c++ with asio(without boost). There are n WorkerThreads(n configured with json). Every WorkerThread get a random ID which will be send to the neighbour in the ring. Every 5 seconds a new voting process should be started. At the end of every voting process, the worker with the highest ID should be printed to console. The project should be compiled with the [login to view URL] and meson_options files.

Infomation to chang roberts algorithm: [login to view URL]

Kemahiran: Pengaturcaraan C++, Socket IO

Tentang Majikan:
( 0 ulasan ) Sigleß, Austria

ID Projek: #29842197