3 sequential algorithm (simplex, game-of-life and heatmap) were sped up using using MPI Framework
Full specification of those algorithms and constraints about their speeding up can be seen here.
Sequential code is modified and then both basic and revised codes are sped up by dividing all of the unit_of_works among the processes.
Sequential code is sped up by dividing the complete work into processes. Some of the data (the first and the last row of the processes' part of the matrix) are exchanged between processes with adjacent rank.
Sequential code is sped up by dividing the complete work into processes. Some of the data (the first and the last row of the processes' part of the matrix) are exchanged between processes with adjacent rank.
Sequential code is sped up using the Manager-Worker technique. One (rank = 0) process was declared as master and all of the others processes requested the job to be done. After the job was done, the result was sent to the master.