This repo contains my homework programs for "Parallel Programming" seminars in MIPT.
- MPI
- Ranks of processes (train.c, guide.c);
- Work time of collective functions (time.c).
- MPI
- Realization of collective functions;
The objective is to make N processes print their ranks in respective order (from 0 to N). There are two realizations.
Each process prints its rank only after recieving message from previous process (process with rank 0 invokes first);
0 process sends message to process m (m < N) that has to print its rank at this moment. After printing its rank, process m sends message to 0 process. When 0 recieves message from m, 0 sends message to m + 1 and waits for response.