#include #include #include #include #include #include #include #include #include #include #include #include #include #include const auto PI = std::acos(-1.0); const auto E = std::exp(1.0); const auto E_POWER_MINUS_PI = std::pow(E, -PI); using namespace hpc; template typename Matrix, Require>> = true> T jacobi_iteration(const Matrix& A, Matrix& B) { assert(A.numRows() > 2 && A.numCols() > 2); T maxdiff = 0; for (std::size_t i = 1; i + 1 < B.numRows(); ++i) { for (std::size_t j = 1; j + 1 < B.numCols(); ++j) { B(i, j) = 0.25 * (A(i - 1, j) + A(i + 1, j) + A(i, j - 1) + A(i, j + 1)); T diff = std::fabs(A(i, j) - B(i, j)); if (diff > maxdiff) maxdiff = diff; } } return maxdiff; } template void exchange_with_neighbors(Matrix& A, int previous, int next, MPI_Datatype rowtype) { MPI_Status status; // upward MPI_Sendrecv(&A(1, 0), 1, rowtype, previous, 0, &A(A.numRows()-1, 0), 1, rowtype, next, 0, MPI_COMM_WORLD, &status); // downward MPI_Sendrecv(&A(A.numRows()-2, 0), 1, rowtype, next, 0, &A(0, 0), 1, rowtype, previous, 0, MPI_COMM_WORLD, &status); } int main(int argc, char** argv) { MPI_Init(&argc, &argv); int nof_processes; MPI_Comm_size(MPI_COMM_WORLD, &nof_processes); int rank; MPI_Comm_rank(MPI_COMM_WORLD, &rank); using namespace hpc::matvec; using namespace hpc::mpi; using namespace hpc::aux; using Matrix = GeMatrix; Matrix A(100, 100, Order::RowMajor); if (rank == 0) { for (auto [i, j, Aij]: A) { if (j == 0) { Aij = std::sin(PI * ((double)i/(A.numRows()-1))); } else if (j == A.numCols() - 1) { Aij = std::sin(PI * ((double)i/(A.numRows()-1))) * E_POWER_MINUS_PI; } else { Aij = 0; } } } UniformSlices slices(nof_processes, A.numRows() - 2); Matrix B1(slices.size(rank) + 2, A.numCols(), Order::RowMajor); for (auto [i, j, Bij]: B1) { Bij = 0; } auto B = B1.block(1, 0).dim(B1.numRows() - 2, B1.numCols()); MPI_Datatype rowtype = get_row_type(B); /* distribute main body of A */ auto A_ = A.block(1, 0).dim(A.numRows() - 2, A.numCols()); scatter_by_row(A_, B, 0, MPI_COMM_WORLD); /* distribute first and last row of A */ if (rank == 0) { copy(A.block(0, 0).dim(1, A.numCols()), B1.block(0, 0).dim(1, B1.numCols())); } if (nof_processes == 1) { copy(A.block(A.numRows()-1, 0).dim(1, A.numCols()), B1.block(B.numRows()-1, 0).dim(1, B1.numCols())); } else if (rank == 0) { MPI_Send(&A(A.numRows()-1, 0), 1, rowtype, nof_processes-1, 0, MPI_COMM_WORLD); } else if (rank == nof_processes - 1) { MPI_Status status; MPI_Recv(&B1(B.numRows()-1, 0), 1, rowtype, 0, 0, MPI_COMM_WORLD, &status); } Matrix B2(B1.numRows(), B1.numCols(), Order::RowMajor); copy(B1, B2); /* actually just the border needs to be copied */ int previous = rank == 0? MPI_PROC_NULL: rank-1; int next = rank == nof_processes-1? MPI_PROC_NULL: rank+1; double eps = 1e-6; unsigned int iterations; for (iterations = 0; ; ++iterations) { double maxdiff = jacobi_iteration(B1, B2); exchange_with_neighbors(B2, previous, next, rowtype); maxdiff = jacobi_iteration(B2, B1); if (iterations % 10 == 0) { double global_max; MPI_Reduce(&maxdiff, &global_max, 1, get_type(maxdiff), MPI_MAX, 0, MPI_COMM_WORLD); MPI_Bcast(&global_max, 1, get_type(maxdiff), 0, MPI_COMM_WORLD); if (global_max < eps) break; } exchange_with_neighbors(B1, previous, next, rowtype); } if (rank == 0) fmt::printf("%d iterations\n", iterations); gather_by_row(B, A_, 0, MPI_COMM_WORLD); MPI_Finalize(); if (rank == 0) { auto pixbuf = create_pixbuf(A, [](double val) -> HSVColor { return HSVColor((1-val) * 240, 1, 1); }, 8); gdk_pixbuf_save(pixbuf, "jacobi.jpg", "jpeg", nullptr, "quality", "100", nullptr); } }