51 auto begin = std::chrono::steady_clock::now();
54 for (
auto& solver : _solvers) solver->setInputParam(
_param);
55 for (
auto& solver : _solvers) solver->setInputDataSet(
_dataset);
56 solver->initializeKernel(stat);
59 int M = PM->get_int(
"M",
LOC(), 1);
60 std::string directory = PM->get_string(
"directory",
LOC(),
"default");
62 MPI_Barrier(MPI_COMM_WORLD);
63 for (
int icalc = guard.
istart; icalc < guard.
iend; ++icalc) {
65 solver->initializeKernel(stat);
66 solver->executeKernel(stat);
67 solver->finalizeKernel(stat);
69 MPI_Barrier(MPI_COMM_WORLD);
71 auto collect = solver->getRuleSet()->getResult(1).data();
72 auto reduced = solver->getRuleSet()->getResult(2).data();
73 for (
int i = 0; i < collect.size(); ++i) {
74 std::cout << std::get<0>(collect[i]) <<
"\n";
75 std::cout << std::get<0>(reduced[i]) <<
"\n";
76 auto [key1, from_data, type1, size1, nframe1] = collect[i];
77 auto [key2, to_data, type2, size2, nframe2] = reduced[i];
83 auto end = std::chrono::steady_clock::now();
84 double total_time =
static_cast<std::chrono::duration<double>
>(end - begin).count();