Reference no: EM132619205

Introduction

Please carry out all sections and document the code with appropriate comments. The assignments should be your own work. Marks will be deducted if there is copying between students or from online sources. Upload the files to BrightSpcae by the deadline.

Communication in a Ring

Communication in a ring:
• Write a MPI program where each rank sends a message to its right neighbour.
• The message is passed around the ring until it reaches the originator rank.
• At this point the message should contain the sum of all the ranks.
• So at termination all ranks should have the sum of the ranks.
• Hints: use non-blocking communications, like the practical and the message does not need to a single integer.
• Write an equivalent operation that does the same using a set MPI Ireduce calls.

Find Determinant using Cramer's Rule

Calculate and print the result on rank 0. The actual result is -2678797333.0/88905600000.0. 2. Use Cramer's rule to find the determinant of the 5x5 matrix below, using 5 MPI processes.

Find the Deadlock

The find the deadlock.f90 (find the deadlock.c) code in Section 5 contains a deadlock. Find and describe the deadlock and try to correct it. The expected behavior is:
• processor 0 reads from a file (cut&paste the file values.dat) 25 random integers;
• processor 0 broadcasts these integers to all the other processors;
• every processor saves in a separate files these values.
NOTE: There is a bug but also some errors in the program. Solving the deadlock does not mean you have reproduced the expected behavior. Take a look at all the program to see if everything is consistent and matches the specs. The expected wall-time of the corrected program is less than 30 second.

Attachment:- Communication in a Ring.rar