46b6db1a4c
* Submitting jobs to cdash * Fail on submit * submit url env * submit url env * try passing submit url as arg * fix submit url * Updated default URL * Add submissions for remaining ubuntu focal workflow jobs * Replace g++ with gcc in dashboard build name * Add --ctest-args to run-ci.sh * Add cdash support for bionic, jammy, and opensuse workflows * Decrease CTEST_CUSTOM_MAXIMUM_PASSED_TEST_OUTPUT_SIZE * OMNITRACE_BUILD_CODECOV option * Support code coverage in CDash script * CI dyninst built with debug info * Update ci-containers - cron schedule moved 4 hours later to UTC+5 * Update implementation of config::configure_signal_handler - using lambdas failed to compile with codecov flags * Add codecov job to ubuntu focal workflow * Fix support for --ctest-args in run-ci script * Fix ubuntu workflows * Fix quotation handling in run-ci script * git safe directory for codecov * New MPI examples * Remove --stop-on-failure * dynamic_library update - find_library_path checks procfs maps - invoke find_library_path with no additional args to resolve to mapped file * RCCLP uses dynamic_library * check if file exists for memory_map_files metadata * Testing updates - include new mpi examples in tests - fix test labels - test critical-trace exe * Update MPI C examples tests (needed arg) * Remove try/catch block from critical-trace * Fix sampling max wait when shutting down * Fix test env for critical-trace * Fix settings for critical-trace - disable time output: data is deterministic - disable PID suffixes: not multiprocess * Update critical-trace ctest * Update critical-trace exe - throw error if input cannot be opened - throw error if input has no data * Update lulesh example with more kokkos tools usage * Fix tasking issue with critical_trace and roctracer - were not setting pools to active - also sync before critical_trace::get_entries * Increase verbosity of critical-trace tests * Update code coverage tests - skip code coverage + preload - code-coverage python example and test * Remove duplication omnitrace.initialize function * Skip python3.6 for ubuntu jammy * Update MPI examples - use MPI_Isend and MPI_Irecv - explicitly use MPI_Bcast * Update Formatting.cmake - include C files in examples * run-ci script does not check return of coverage * mpi-allreduce link to libm * Update ctest args in run-ci script * Update dyninst submodule - safety improvements in BinaryEdit::openResolvedLibraryName * capture cmake error for ctest_coverage
95 라인
2.7 KiB
C
95 라인
2.7 KiB
C
// Author: Wes Kendall
|
|
// Copyright 2013 www.mpitutorial.com
|
|
// This code is provided freely with the tutorials on mpitutorial.com. Feel
|
|
// free to modify it for your own use. Any distribution of the code must
|
|
// either provide a link to www.mpitutorial.com or keep this header intact.
|
|
//
|
|
// Program that computes the standard deviation of an array of elements in parallel using
|
|
// MPI_Reduce.
|
|
//
|
|
#include <assert.h>
|
|
#include <math.h>
|
|
#include <mpi.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
|
|
// Creates an array of random numbers. Each number has a value from 0 - 1
|
|
float*
|
|
create_rand_nums(int num_elements)
|
|
{
|
|
float* rand_nums = (float*) malloc(sizeof(float) * num_elements);
|
|
assert(rand_nums != NULL);
|
|
int i;
|
|
for(i = 0; i < num_elements; i++)
|
|
{
|
|
rand_nums[i] = (rand() / (float) RAND_MAX);
|
|
}
|
|
return rand_nums;
|
|
}
|
|
|
|
int
|
|
main(int argc, char** argv)
|
|
{
|
|
if(argc != 2)
|
|
{
|
|
fprintf(stderr, "Usage: avg num_elements_per_proc\n");
|
|
exit(1);
|
|
}
|
|
|
|
int num_elements_per_proc = atoi(argv[1]);
|
|
|
|
MPI_Init(NULL, NULL);
|
|
|
|
int world_rank;
|
|
MPI_Comm_rank(MPI_COMM_WORLD, &world_rank);
|
|
int world_size;
|
|
MPI_Comm_size(MPI_COMM_WORLD, &world_size);
|
|
|
|
// Create a random array of elements on all processes.
|
|
srand(time(NULL) *
|
|
world_rank); // Seed the random number generator of processes uniquely
|
|
float* rand_nums = NULL;
|
|
rand_nums = create_rand_nums(num_elements_per_proc);
|
|
|
|
// Sum the numbers locally
|
|
float local_sum = 0;
|
|
int i;
|
|
for(i = 0; i < num_elements_per_proc; i++)
|
|
{
|
|
local_sum += rand_nums[i];
|
|
}
|
|
|
|
// Reduce all of the local sums into the global sum in order to
|
|
// calculate the mean
|
|
float global_sum;
|
|
MPI_Allreduce(&local_sum, &global_sum, 1, MPI_FLOAT, MPI_SUM, MPI_COMM_WORLD);
|
|
float mean = global_sum / (num_elements_per_proc * world_size);
|
|
|
|
// Compute the local sum of the squared differences from the mean
|
|
float local_sq_diff = 0;
|
|
for(i = 0; i < num_elements_per_proc; i++)
|
|
{
|
|
local_sq_diff += (rand_nums[i] - mean) * (rand_nums[i] - mean);
|
|
}
|
|
|
|
// Reduce the global sum of the squared differences to the root process
|
|
// and print off the answer
|
|
float global_sq_diff;
|
|
MPI_Reduce(&local_sq_diff, &global_sq_diff, 1, MPI_FLOAT, MPI_SUM, 0, MPI_COMM_WORLD);
|
|
|
|
// The standard deviation is the square root of the mean of the squared
|
|
// differences.
|
|
if(world_rank == 0)
|
|
{
|
|
float stddev = sqrt(global_sq_diff / (num_elements_per_proc * world_size));
|
|
printf("Mean - %f, Standard deviation = %f\n", mean, stddev);
|
|
}
|
|
|
|
// Clean up
|
|
free(rand_nums);
|
|
|
|
MPI_Barrier(MPI_COMM_WORLD);
|
|
MPI_Finalize();
|
|
}
|