blob: e3b82ed2a258afafde0862bc4d0bb7105e559181 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/* Copyright 2020-2021 Michael Rowan, Yinjian Zhao
*
* This file is part of WarpX.
*
* License: BSD-3-Clause-LBNL
*/
#include "LoadBalanceEfficiency.H"
#include "Diagnostics/ReducedDiags/ReducedDiags.H"
#include "WarpX.H"
#include <AMReX_ParallelDescriptor.H>
#include <AMReX_ParmParse.H>
#include <AMReX_REAL.H>
#include <algorithm>
#include <ostream>
#include <vector>
using namespace amrex;
// constructor
LoadBalanceEfficiency::LoadBalanceEfficiency (std::string rd_name)
: ReducedDiags{rd_name}
{
// read number of levels
int nLevel = 0;
ParmParse pp_amr("amr");
pp_amr.query("max_level", nLevel);
nLevel += 1;
// resize data array
m_data.resize(nLevel, 0.0_rt);
if (ParallelDescriptor::IOProcessor())
{
if ( m_IsNotRestart )
{
// open file
std::ofstream ofs{m_path + m_rd_name + "." + m_extension, std::ofstream::out};
// write header row
int c = 0;
ofs << "#";
ofs << "[" << c++ << "]step()";
ofs << m_sep;
ofs << "[" << c++ << "]time(s)";
for (int lev = 0; lev < nLevel; ++lev)
{
ofs << m_sep;
ofs << "[" << c++ << "]lev" + std::to_string(lev);
}
ofs << std::endl;
// close file
ofs.close();
}
}
}
// Get the load balance efficiency
void LoadBalanceEfficiency::ComputeDiags (int step)
{
// Judge if the diags should be done
if (!m_intervals.contains(step+1)) { return; }
// get a reference to WarpX instance
auto & warpx = WarpX::GetInstance();
// get number of level
const auto nLevel = warpx.finestLevel() + 1;
// loop over refinement levels
for (int lev = 0; lev < nLevel; ++lev)
{
// save data
m_data[lev] = warpx.getLoadBalanceEfficiency(lev);
}
// end loop over refinement levels
/* m_data now contains up-to-date values for:
* [load balance efficiency at level 0,
* load balance efficiency at level 1,
* load balance efficiency at level 2,
* ......] */
}
|
