This project solves distributed computing problem using MPI protocol. It exists in imaginary world of Guild of Thieves. Problem was introduced by Phd. Arkadiusz Danilecki.
Thieves have rights for robbing aristocracy houses under several rules.
- Each thief needs to find a pair before robbing a house. They can’t rob a house on their own.
- Single house can be robbed by only one pair of thieves at time.
- Before robbery thieves need to complete a lot of paper work. This action takes lots of time since thieves aren’t well educated. What is more, only S thieves can sign papers at the same time.
- After being robbed, the house needs to bypassed for some time.
There are H houses and T thieves. T doesn’t have to be an even number. T > H, T > S. Relation between H and S is not known.
Guild of Thiefs
make
mpirun -default-hostfile none -np *number_of_processes* ./bin/main