Answered step by step
Verified Expert Solution
Question
1 Approved Answer
You will generate an array of 2048 random numbers of type int to test the parallelized algorithm. The algorithm assumes that the number of data
You will generate an array of 2048 random numbers of type int to test the parallelized algorithm. The algorithm assumes that the number of data items to be sorted is evenly divisible by the number of processes. You will test the program under different configurations and measure the timings for each configuration. The different configurations to use for testing are: 1. One node with 1,2, 4, and 8 processes per node. One node with 1 process is serial execution. 2. Two nodes with 1, 2, 4 and 8 processes per node 3. Four nodes with 1, 2, 4 and 8 processes per node. 4. Eight nodes with 1, 2, 4, and 8 processes per node. NOTE: Do not run the program on the login node. Please run it as a batch program using the Portable Batch System (PBS) like you did when running the MPI labs. You can use the attached the PBS script file to run the tests. Make sure to update it with your information before using. Graph the elapsed time vs comm sz (processes per node). Clearly show the configuration associated with each graph
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started