
The MPI program 'Standard-Deviation.c' computes the standard deviation for an array of elements.Here, we assume that the maximum number of elements in the array is 10. Some necessary error checkings are performed to ensure that the number of inputs is correct and their values are valid.
(a) mpiexec -n 2 ./Stddev (b) mpiexec -n 2 ./Stddev 0 (c) mpiexec -n 3 ./Stddev 7
(d) mpiexec -n 3 ./Stddev 9 (e) mpiexec -n 4 ./Stddev 21
Standard-Deviation.c. This code is giving me an error when I compile
///////////////////////////////////////////////////////////////////////////////////////
//
// This is an MPI program that computes the standard deviation for an array of elements.
//
// Note: The array is generated according to its size (the number of elements), which
// is specified by users from the command line. In the program, we assume its
// maximum number is 10.
//
// Compile: mpicc Standard-Deviation.c -o Stddev -lm
//
// Run: mpiexec -n <p> ./Stddev <N>
//
// -p: the number of processes
// -N: the number of elements
//
///////////////////////////////////////////////////////////////////////////////////////
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <mpi.h>
int *Random_Num_Generator(int Num_Elements);
int Compute_Sum(int *array, int num_elements);
int main(int argc, char** argv)
{
int comm_sz, my_rank;
int i, Product;
double local_start, local_finish, local_elapsed, elapsed;
//Seed the random number generator to get different results each time
srand(time(NULL));
MPI_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);
MPI_Comm_size(MPI_COMM_WORLD, &comm_sz);
if (argc != 2)
{
if (my_rank == 0)
fprintf(stderr, "USAGE: mpiexec -n <num_of_processes> Stddev <num_elements>\n");
MPI_Finalize();
return 0;
}
int Num_Elements = atoi(argv[1]);
if (Num_Elements < 1 || Num_Elements > 10)
{
if (my_rank == 0)
fprintf(stderr, "Error: The size of the
MPI_Finalize();
return 0;
}
if (Num_Elements % comm_sz != 0)
{
if (my_rank == 0)
fprintf(stderr, "Error: The size of the vector should be evenly divisible by the number of Processes!\n");
MPI_Finalize();
return 0;
}int *Random_Nums = NULL;
if (my_rank == 0)
{
Random_Nums = Random_Num_Generator(Num_Elements);
printf("\nThe random numbers generated: \n");
for (i = 0; i < Num_Elements; i++)
printf("%d ", Random_Nums[i]);
printf("\n");
}
int Num_Per_Proc = Num_Elements / comm_sz;
int *Sub_Random_Nums = (int *)malloc(sizeof(int) * Num_Per_Proc);
MPI_Scatter(Random_Nums, Num_Per_Proc, MPI_INT, Sub_Random_Nums, Num_Per_Proc, MPI_INT, 0, MPI_COMM_WORLD);
MPI_Barrier(MPI_COMM_WORLD);
local_start = MPI_Wtime();
// Compute the sum of the subset array on each process
int Sub_Sum = Compute_Sum(Sub_Random_Nums, Num_Per_Proc);
// Compute the sum of the entire array and distribute it to each process
int Total_Sum;
MPI_Allreduce(&Sub_Sum, &Total_Sum, 1, MPI_INT, MPI_SUM, MPI_COMM_WORLD);
// Compute the average of the entire array on each process
float Average = (float) Total_Sum / Num_Elements;
// Compute the partial sum of the squared differences from the average on each process
float Sub_Square_diff = 0;
for (i = 0; i < Num_Per_Proc; i++)
Sub_Square_diff += (Sub_Random_Nums[i] - Average) * (Sub_Random_Nums[i] - Average);
// Reduce the total sum of the squared differences to the process 0 (root process)
float Total_Square_diff;
MPI_Reduce(&Sub_Square_diff, &Total_Square_diff, 1, MPI_FLOAT, MPI_SUM, 0, MPI_COMM_WORLD);
// Compute the standard deviation
if (my_rank == 0)
{
// The standard deviation is the square root of the averaged total sum of squared differences
float Standard_Deviation = sqrt(Total_Square_diff / Num_Elements);
printf("Standard deviation = %f\n", Standard_Deviation);
}
local_finish = MPI_Wtime();
local_elapsed = local_finish - local_start;
MPI_Reduce(&local_elapsed, &elapsed, 1, MPI_DOUBLE, MPI_MAX, 0, MPI_COMM_WORLD);
if (my_rank == 0)
printf("Elapsed time = %e seconds\n", elapsed);
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// End point for Code to be timed
//
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Clean up
if (my_rank == 0)
free(Random_Nums);
free(Sub_Random_Nums);
MPI_Barrier(MPI_COMM_WORLD);
MPI_Finalize();
return 0;
}
// Create an array of random integer numbers ranging from 1 to 10
int *Random_Num_Generator(int Num_Elements)
{
int *Rand_Nums = (int *)malloc(sizeof(int) * Num_Elements);
int i;
for (i = 0; i < Num_Elements; i++)
Rand_Nums[i] = (rand() % 10) + 1;
return Rand_Nums;
}
// Computes the sum of an array of numbers
int Compute_Sum(int *array, int num_elements)
{
int sum = 0;
int i;
for (i = 0; i < num_elements; i++)
sum += array[i];
return sum;
}

Step by stepSolved in 2 steps with 5 images

- Write pseudocode to solve the following problem. Must use iterative dynamic programming (tabulation) and run in O(n) time. Input: positive integer n Output: two non-negative integer x and y where n = x185 + y120 Example: if n=1230 then x=6 and y=1 (1314 = 6(185) + 1(120))arrow_forwardArray. Make the code as simple as possible.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





