Homec4science
Diffusion phpc-2021 (master) Browse

phpc-2021/Serie05/pi/solutions/pi_p2p_async_ring.cc
9d6f8d6b0c7bmaster

Last Change
Raw File

pi_p2p_async_ring.cc
View Options

/*
This exercise is taken from the class Parallel Programming Workshop (MPI,
OpenMP and Advanced Topics) at HLRS given by Rolf Rabenseifner
*/
#include <chrono>
#include <cstdio>
#include <cmath>
#include <mpi.h>
using clk = std::chrono::high_resolution_clock;
using second = std::chrono::duration<double>;
using time_point = std::chrono::time_point<clk>;
inline int digit(double x, int n) {
return std::trunc(x * std::pow(10., n)) - std::trunc(x * std::pow(10., n - 1)) *10.;
}
inline double f(double a) { return (4. / (1. + a * a)); }
const int n = 10000000;
int main(int /* argc */ , char ** /* argv */) {
int i;
double dx, x, sum, pi;
int psize, prank;
MPI_Init(NULL, NULL);
MPI_Comm_size(MPI_COMM_WORLD, &psize);
MPI_Comm_rank(MPI_COMM_WORLD, &prank);
auto mpi_t1 = MPI_Wtime();
auto t1 = clk::now();
int nlocal = n / psize;
int istart = 1 + nlocal * prank;
int iend = nlocal * (prank + 1);
/* calculate pi = integral [0..1] 4 / (1 + x**2) dx */
dx = 1. / n;
sum = 0.0;
for (i = istart; i <= iend; i++) {
x = (1. * i - 0.5) * dx;
sum = sum + f(x);
}
int next = (prank + 1) % psize;
int prev = (prank - 1 + psize) % psize;
double send, recv;
MPI_Request request;
send = sum;
for(int s = 1; s < psize; ++s) {
MPI_Isend(&send, 1, MPI_DOUBLE, next, 13, MPI_COMM_WORLD, &request);
MPI_Recv(&recv, 1, MPI_DOUBLE, prev, 13, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
sum += recv;
MPI_Wait(&request, MPI_STATUS_IGNORE);
send = recv;
}
pi = dx * sum;
auto mpi_elapsed = MPI_Wtime() - mpi_t1;
second elapsed = clk::now() - t1;
if(prank == 0) {
std::printf("computed pi = %.16g\n", pi);
std::printf("wall clock time (mpi_wtime) = %.4gs with %d process\n", mpi_elapsed, psize);
std::printf("wall clock time (chrono) = %.4gs\n", elapsed.count());
for(int d = 1; d <= 15; ++d) {
std::printf("%d", digit(pi, d));
}
}
MPI_Finalize();
return 0;
}
c4science · Help