232 lines
5.1 KiB
C
232 lines
5.1 KiB
C
#define _XOPEN_SOURCE 600
|
|
#include <math.h>
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <sys/time.h>
|
|
|
|
// TASK: T1a
|
|
// Include the MPI headerfile
|
|
// BEGIN: T1a
|
|
#include <mpi.h>
|
|
// END: T1a
|
|
|
|
// Option to change numerical precision.
|
|
typedef int64_t int_t;
|
|
typedef double real_t;
|
|
|
|
// TASK: T1b
|
|
// Declare variables each MPI process will need
|
|
// BEGIN: T1b
|
|
#define ROOT 0
|
|
int comm_size;
|
|
int comm_rank;
|
|
int_t n;
|
|
// END: T1b
|
|
|
|
// Simulation parameters: size, step count, and how often to save the state.
|
|
const int_t
|
|
N = 65536,
|
|
max_iteration = 100000,
|
|
snapshot_freq = 500;
|
|
|
|
// Wave equation parameters, time step is derived from the space step.
|
|
const real_t
|
|
c = 1.0,
|
|
dx = 1.0;
|
|
real_t
|
|
dt;
|
|
|
|
// Buffers for three time steps, indexed with 2 ghost points for the boundary.
|
|
real_t
|
|
*buffers[3] = { NULL, NULL, NULL };
|
|
|
|
#define U_prv(i) buffers[0][(i) + 1]
|
|
#define U(i) buffers[1][(i) + 1]
|
|
#define U_nxt(i) buffers[2][(i) + 1]
|
|
|
|
// Convert 'struct timeval' into seconds in double prec. floating point
|
|
#define WALLTIME(t) ((double)(t).tv_sec + 1e-6 * (double)(t).tv_usec)
|
|
|
|
// TASK: T8
|
|
// Save the present time step in a numbered file under 'data/'.
|
|
void domain_save(int_t step) {
|
|
// BEGIN: T8
|
|
if (comm_rank != ROOT)
|
|
return;
|
|
char filename[256];
|
|
sprintf(filename, "data/%.5ld.dat", step);
|
|
FILE *out = fopen(filename, "wb");
|
|
fwrite(&U(0), sizeof(real_t), N, out);
|
|
fclose(out);
|
|
// END: T8
|
|
}
|
|
|
|
// TASK: T3
|
|
// Allocate space for each process' sub-grids
|
|
// Set up our three buffers, fill two with an initial cosine wave,
|
|
// and set the time step.
|
|
void domain_initialize(void) {
|
|
// BEGIN: T3
|
|
const int_t bufsize = (comm_rank == ROOT ? N : n + 2);
|
|
buffers[0] = malloc(bufsize * sizeof(real_t));
|
|
buffers[1] = malloc(bufsize * sizeof(real_t));
|
|
buffers[2] = malloc(bufsize * sizeof(real_t));
|
|
|
|
int_t offset = 0;
|
|
for (int i = 0; i < comm_rank; i++) {
|
|
int proc_n = N / comm_size + (i < N % comm_size);
|
|
offset += proc_n;
|
|
}
|
|
|
|
for (int_t i = 0; i < n; i++) {
|
|
U_prv(i) = U(i) = cos(2 * M_PI * (i + offset) / (real_t)N);
|
|
}
|
|
// END: T3
|
|
|
|
// Set the time step for 1D case.
|
|
dt = dx / c;
|
|
}
|
|
|
|
// Return the memory to the OS.
|
|
void domain_finalize(void) {
|
|
free(buffers[0]);
|
|
free(buffers[1]);
|
|
free(buffers[2]);
|
|
}
|
|
|
|
// Rotate the time step buffers.
|
|
void move_buffer_window(void) {
|
|
real_t *temp = buffers[0];
|
|
buffers[0] = buffers[1];
|
|
buffers[1] = buffers[2];
|
|
buffers[2] = temp;
|
|
}
|
|
|
|
// TASK: T4
|
|
// Derive step t+1 from steps t and t-1.
|
|
void time_step(void) {
|
|
// BEGIN: T4
|
|
for (int_t i = 0; i < n; i++) {
|
|
U_nxt(i) = -U_prv(i) + 2.0 * U(i) + (dt * dt * c * c) / (dx * dx) * (U(i - 1) + U(i + 1) - 2.0 * U(i));
|
|
}
|
|
// END: T4
|
|
}
|
|
|
|
// TASK: T6
|
|
// Neumann (reflective) boundary condition.
|
|
void boundary_condition(void) {
|
|
// BEGIN: T6
|
|
if (comm_rank == ROOT) {
|
|
U(-1) = U(1);
|
|
}
|
|
if (comm_rank == comm_size - 1) {
|
|
U(n) = U(n - 2);
|
|
}
|
|
// END: T6
|
|
}
|
|
|
|
// TASK: T5
|
|
// Communicate the border between processes.
|
|
void border_exchange(void) {
|
|
// BEGIN: T5
|
|
if (comm_size == 1)
|
|
return;
|
|
int left = (comm_size + comm_rank - 1) % comm_size;
|
|
int right = (comm_rank + 1) % comm_size;
|
|
|
|
MPI_Sendrecv(&U(n - 1), 1, MPI_DOUBLE, right, 0,
|
|
&U(-1), 1, MPI_DOUBLE, left, 0,
|
|
MPI_COMM_WORLD, MPI_STATUS_IGNORE);
|
|
|
|
MPI_Sendrecv(&U(0), 1, MPI_DOUBLE, left, 1,
|
|
&U(n), 1, MPI_DOUBLE, right, 1,
|
|
MPI_COMM_WORLD, MPI_STATUS_IGNORE);
|
|
// END: T5
|
|
}
|
|
|
|
// TASK: T7
|
|
// Every process needs to communicate its results
|
|
// to root and assemble it in the root buffer
|
|
void send_data_to_root() {
|
|
// BEGIN: T7
|
|
if (comm_size == 1)
|
|
return;
|
|
if (comm_rank != ROOT) {
|
|
MPI_Send(&U(0), n, MPI_DOUBLE, ROOT, 0, MPI_COMM_WORLD);
|
|
} else {
|
|
int offset = n;
|
|
for (int i = 1; i < comm_size; i++) {
|
|
int proc_n = N / comm_size + (i < N % comm_size);
|
|
MPI_Recv(&U(offset), proc_n, MPI_DOUBLE, i, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
|
|
offset += proc_n;
|
|
}
|
|
}
|
|
// END: T7
|
|
}
|
|
|
|
// Main time integration.
|
|
void simulate(void) {
|
|
// Go through each time step.
|
|
for (int_t iteration = 0; iteration <= max_iteration; iteration++) {
|
|
if ((iteration % snapshot_freq) == 0) {
|
|
send_data_to_root();
|
|
domain_save(iteration / snapshot_freq);
|
|
}
|
|
|
|
// Derive step t+1 from steps t and t-1.
|
|
border_exchange();
|
|
boundary_condition();
|
|
time_step();
|
|
|
|
move_buffer_window();
|
|
}
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
// TASK: T1c
|
|
// Initialise MPI
|
|
// BEGIN: T1c
|
|
MPI_Init(&argc, &argv);
|
|
MPI_Comm_rank(MPI_COMM_WORLD, &comm_rank);
|
|
MPI_Comm_size(MPI_COMM_WORLD, &comm_size);
|
|
|
|
n = N / comm_size;
|
|
int_t remr = N % comm_size;
|
|
if (comm_rank < remr)
|
|
n++;
|
|
// END: T1c
|
|
|
|
struct timeval t_start, t_end;
|
|
|
|
domain_initialize();
|
|
|
|
// TASK: T2
|
|
// Time your code
|
|
// BEGIN: T2
|
|
if (comm_rank == ROOT)
|
|
gettimeofday(&t_start, NULL);
|
|
|
|
simulate();
|
|
MPI_Barrier(MPI_COMM_WORLD);
|
|
|
|
if (comm_rank == ROOT) {
|
|
gettimeofday(&t_end, NULL);
|
|
|
|
printf("Total elapsed time: %lf seconds\n",
|
|
WALLTIME(t_end) - WALLTIME(t_start));
|
|
}
|
|
// END: T2
|
|
|
|
domain_finalize();
|
|
|
|
// TASK: T1d
|
|
// Finalise MPI
|
|
// BEGIN: T1d
|
|
MPI_Finalize();
|
|
// END: T1d
|
|
|
|
exit(EXIT_SUCCESS);
|
|
}
|