Abstract
Analyze the possibilities of implementing a parallel algorithm to test the singularity of the N-th order matrix. Design
and implement in (C/Cþþ) a solution based on sending messages between nodes using the PVM system library.
Distribute the load among the nodes such that the computation time is as small as possible. Find out how the execution
time and calculation acceleration depend on the number of nodes and the size of the problem (indicate the table and
graphs). Based on the results, estimate the communication latency, for what size the task is (well) scalable on the given
architecture, and what is the maximum size when the calculation is still bearable on the available architecture by divide
the program into master -slave model which is able to send tasks and collect the results to receive it by master computer
and implement in (C/Cþþ) a solution based on sending messages between nodes using the PVM system library.
Distribute the load among the nodes such that the computation time is as small as possible. Find out how the execution
time and calculation acceleration depend on the number of nodes and the size of the problem (indicate the table and
graphs). Based on the results, estimate the communication latency, for what size the task is (well) scalable on the given
architecture, and what is the maximum size when the calculation is still bearable on the available architecture by divide
the program into master -slave model which is able to send tasks and collect the results to receive it by master computer
Keywords
Masteryslave model
Parallel program
Pthread
PVM
Keywords
Pthread، PVM، البرنامج المتوازي، نموذج Masteryslave