Sergei Nemnyugin

Lab 7 Task decomposition with OpenMP 3.0

2011

cpp from directory classfiles\Lab07\Templates to directory classfiles\Lab07\Dijkstra_serial.cpp) with notepad text editor and change line: const int N = 500. 2) Add Intel compiler to the PATH environment variable: export PATH=$PATH:/opt/intel/compilers/bin Build and Run Dijkstra Serial Application 1) Navigate to the classfiles\Lab07\Dijkstra_serial directory and start make to build the application: cd classfiles\Lab07\Dijkstra_serial nmake 2) Run the application (Dijkstra_serial. To do this open source file (Dijkstra_serial. Record elapsed time:____________________________________________________. . Repeat 2) at least 5 times and find average:_________________________________. Setting Up 1) Copy file of the serial program Dijkstra_serial.exe). 3) Repeat with different graph’s sizes (up to 5000).Activity 1 – Serial implementation of the Dijkstra all-pairs shortest paths algorithm Time Required Objective Ten minutes • Measure performance of serial implementation of the Dijkstra all-pairs shortest paths algorithm.

Record elapsed time:____________________________________________________. Repeat 2) at least 5 times and find average:_________________________________. 3) Change number of threads to 2. To do this open source file (Dijkstra_tasks. number of threads. directory Build and Run OpenMP Parallel Dijkstra Application 1) Navigate to the classfiles\Lab07\Dijkstra_tasks directory and start make to build the application: cd classfiles\Lab07\Dijkstra_tasks nmake 2) Run the application (Dijkstra_tasks. Make a conclusion about efficiency of both versions.cpp from classfiles\Lab07\Templates to directory classfiles\Lab07\Dijkstra_tasks. 6) Repeat with different graph’s sizes (up to 5000). 5) Plot data on the diagram speedup vs. Setting Up Copy file of the OpenMP parallel program Dijkstra_tasks. 4) Repeat 3) for a set of numbers of threads.cpp) with notepad text editor and change line: 7) Compare results of Activities 1 and 2.exe).Activity 2 – OpenMP parallel solution of the Dijkstra all-pairs shortest paths algorithm Time Required Objective Fifteen minutes • Measure performance of OpenMP parallel implementation of the Dijkstra all-pairs shortest paths algorithm. . Repeat 2) at least 5 times and find average:_________________________________.

Record elapsed time:____________________________________________________.cpp) with notepad text editor and change line: const int N = 500.cpp from classfiles\Lab07\Templates to directory classfiles\Lab07\Floyd_serial. Repeat 2) at least 5 times and find average:_________________________________. 3) Repeat with different graph’s sizes (up to 5000). To do this open source file (Floyd_serial. directory Build and Run Floyd’s Serial Application 1) Navigate to the classfiles\Lab07\Floyd_serial directory and start make to build the application: cd classfiles\Lab07\Floyd_serial nmake 2) Run the application (Floyd_serial.exe).Activity 3 – Serial implementation of the Floyd’s allpairs shortest paths algorithm Time Required Objective Ten minutes • Measure performance of serial implementation of the Floyd’s all-pairs shortest paths algorithm. Setting Up Copy file of the serial program Floyd_serial. .

exe).Activity 4 – OpenMP parallel solution of the Floyd’s all-pairs shortest paths algorithm Time Required Objective Fifteen minutes • Measure performance of OpenMP parallel implementation of the Floyd’s all-pairs shortest paths algorithm. 6) Repeat with different graph’s sizes (up to 5000). Repeat 2) at least 5 times and find average:_________________________________. 4) Repeat 3) for a set of numbers of threads. Repeat 2) at least 5 times and find average:_________________________________. directory Build and Run OpenMP Parallel Floyd Application 1) Navigate to the classfiles\Lab07\Floyd_tasks directory and start make to build the application: cd classfiles\Lab07\Floyd_tasks nmake 2) Run the application (Floyd_tasks. Setting Up Copy file of the OpenMP parallel program Floyd_tasks. Record elapsed time:____________________________________________________.cpp) with notepad text editor and change line: const int N = 500. number of threads. To do this open source file (Floyd_tasks. 3) Change number of threads to 2. .cpp from classfiles\Lab07\Templates to directory classfiles\Lab07\Floyd_tasks. 5) Plot data on the diagram speedup vs.

. Make a conclusion about efficiency of both versions.7) Compare results of Activities 1 and 2.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.