-
Notifications
You must be signed in to change notification settings - Fork 0
/
Grid.cpp
270 lines (232 loc) · 10.3 KB
/
Grid.cpp
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
/*!
* @file Grid.cpp
* @date 23 Aug 2024
* @author Athena Elafrou <ae488@cam.ac.uk>
*/
#include "Grid.hpp"
#include "Utils.hpp"
#include <algorithm>
#include <cmath>
#include <stdexcept>
#include <netcdf.h>
#include <netcdf_par.h>
static void find_factors(int n, int& factor_a, int& factor_b)
{
for (int i = 2; i * i <= n; i += 2) {
if (n % i == 0) {
factor_a = i;
factor_b = n / factor_a;
}
}
}
Grid* Grid::create(MPI_Comm comm, const std::string& filename, bool ignore_mask)
{
return new Grid(comm, filename, "x", "y", "mask", 1, 1, ignore_mask);
}
Grid* Grid::create(
MPI_Comm comm, const std::string& filename, int blk_dim0, int blk_dim1, bool ignore_mask)
{
return new Grid(comm, filename, "x", "y", "mask", blk_dim0, blk_dim1, ignore_mask);
}
Grid* Grid::create(MPI_Comm comm, const std::string& filename, const std::string dim0_name,
const std::string dim1_name, const std::string mask_name, bool ignore_mask)
{
return new Grid(comm, filename, dim0_name, dim1_name, mask_name, 1, 1, ignore_mask);
}
Grid* Grid::create(MPI_Comm comm, const std::string& filename, const std::string dim0_name,
const std::string dim1_name, const std::string mask_name, int blk_dim0, int blk_dim1,
bool ignore_mask)
{
return new Grid(
comm, filename, dim0_name, dim1_name, mask_name, blk_dim0, blk_dim1, ignore_mask);
}
Grid::Grid(MPI_Comm comm, const std::string& filename, const std::string& dim0_name,
const std::string& dim1_name, const std::string& mask_name, int blk_dim0, int blk_dim1,
bool ignore_mask)
: _comm(comm)
, _blk_factor_0(blk_dim0)
, _blk_factor_1(blk_dim1)
{
// Use C API for parallel I/O
int nc_id, nc_o_mode;
nc_o_mode = NC_NOWRITE;
NC_CHECK(nc_open_par(filename.c_str(), nc_o_mode, _comm, MPI_INFO_NULL, &nc_id));
// Extract group ID in case of enhanced data model
int data_nc_id;
int ret = nc_inq_ncid(nc_id, "data", &data_nc_id);
if (ret != NC_NOERR)
data_nc_id = nc_id;
int dim0_nc_id, dim1_nc_id;
// I have switched the order of the dimensions here to reflect the change of
// indices in nextsim-dg
NC_CHECK(nc_inq_dimid(data_nc_id, dim1_name.c_str(), &dim0_nc_id));
NC_CHECK(nc_inq_dimid(data_nc_id, dim0_name.c_str(), &dim1_nc_id));
CHECK_MPI(MPI_Comm_rank(comm, &_rank));
// Retrieve the extent of each dimension of interest. The dimensions of
// interest are the spatial dimensions of the grid. These are named "x" and
// "y" by default.
// I have switched the order of the dimensions here to reflect the change of
// indices in nextsim-dg
size_t tmp_0, tmp_1;
NC_CHECK(nc_inq_dimlen(data_nc_id, dim1_nc_id, &tmp_0));
NC_CHECK(nc_inq_dimlen(data_nc_id, dim0_nc_id, &tmp_1));
_global_ext_0 = static_cast<int>(tmp_0);
_global_ext_1 = static_cast<int>(tmp_1);
_global_ext_blk_0 = ceil(static_cast<float>(_global_ext_0) / _blk_factor_0);
_global_ext_blk_1 = ceil(static_cast<float>(_global_ext_1) / _blk_factor_1);
// Initially we partition assuming there is no land mask
// Figure out my subset of objects
CHECK_MPI(MPI_Comm_size(comm, &_num_procs));
// Start from a 2D decomposition
_num_procs_0 = _num_procs;
_num_procs_1 = 1;
find_factors(_num_procs, _num_procs_0, _num_procs_1);
_local_ext_blk_0 = ceil(static_cast<float>(_global_ext_blk_0) / _num_procs_0);
_local_ext_blk_1 = ceil(static_cast<float>(_global_ext_blk_1) / _num_procs_1);
_global_blk_0 = (_rank / _num_procs_1) * _local_ext_blk_0;
_global_blk_1 = (_rank % _num_procs_1) * _local_ext_blk_1;
if ((_rank / _num_procs_1) == _num_procs_0 - 1) {
_local_ext_blk_0 = _global_ext_blk_0 - (_rank / _num_procs_1) * _local_ext_blk_0;
}
if ((_rank % _num_procs_1) == _num_procs_1 - 1) {
_local_ext_blk_1 = _global_ext_blk_1 - (_rank % _num_procs_1) * _local_ext_blk_1;
}
_local_ext_0 = _local_ext_blk_0 * _blk_factor_0;
_local_ext_1 = _local_ext_blk_1 * _blk_factor_1;
if ((_rank / _num_procs_1) == _num_procs_0 - 1) {
_local_ext_0 = _global_ext_0 - _global_blk_0 * _blk_factor_0;
}
if ((_rank % _num_procs_1) == _num_procs_1 - 1) {
_local_ext_1 = _global_ext_1 - _global_blk_1 * _blk_factor_1;
}
_global_0 = _global_blk_0 * _blk_factor_0;
_global_1 = _global_blk_1 * _blk_factor_1;
_num_objects = _local_ext_0 * _local_ext_1;
_num_blks = _local_ext_blk_0 * _local_ext_blk_1;
// Retrieve the land mask, if available and enabled
int mask_nc_id;
int nc_err;
nc_err = nc_inq_varid(data_nc_id, mask_name.c_str(), &mask_nc_id);
if (!ignore_mask && nc_err == NC_NOERR && nc_err != NC_ENOTVAR) {
// Data reads are independent by default, so we need to switch to
// collective for improved parallel I/O performance
NC_CHECK(nc_var_par_access(data_nc_id, mask_nc_id, NC_COLLECTIVE));
// Verify the order of dimensions provided is correct by comparing to the
// dimension order of the mask variable
const int NDIMS = 2;
int dim_id[NDIMS];
char dim_name[NDIMS][128];
NC_CHECK(nc_inq_vardimid(data_nc_id, mask_nc_id, &dim_id[0]));
// I have switched the order of the dimensions here to reflect the change of
// indices in nextsim-dg
NC_CHECK(nc_inq_dimname(data_nc_id, dim_id[1], &dim_name[0][0]));
NC_CHECK(nc_inq_dimname(data_nc_id, dim_id[0], &dim_name[1][0]));
if (dim_name[0] != dim0_name || dim_name[1] != dim1_name) {
throw std::runtime_error("Dimension ordering provided does not match "
"ordering in netCDF grid file");
}
_land_mask.resize(_num_objects);
size_t start[NDIMS], count[NDIMS];
// I have switched the order of the dimensions here to reflect the change of
// indices in nextsim-dg
// Coordinate of first element
start[1] = _global_0;
start[0] = _global_1;
// Number of elements in every extension
count[1] = _local_ext_0;
count[0] = _local_ext_1;
NC_CHECK(nc_get_vara_int(data_nc_id, mask_nc_id, start, count, _land_mask.data()));
// create copy of land mask ready to transpose
std::vector<int> _land_mask_copy(_land_mask);
// transpose _land_mask to reflect the change of indices in nextsim-dg
int index = 0;
for (size_t j = 0; j < count[1]; j++) {
for (size_t i = 0; i < count[0]; i++) {
_land_mask[index] = _land_mask_copy[i * count[1] + j];
index++;
}
}
// Apply land mask
if (_blk_factor_0 == 1 && _blk_factor_1 == 1) {
for (int i = 0; i < _num_objects; i++) {
// The convention is that sea data points will have a positive value
// and land points a zero value
if (_land_mask[i] > 0) {
int local_0 = i / _local_ext_1;
int local_1 = i % _local_ext_1;
int global_0 = local_0 + _global_0;
int global_1 = local_1 + _global_1;
_object_id.push_back(global_0 * _global_ext_1 + global_1);
_sparse_to_dense.push_back(i);
_num_nonzero_objects++;
}
}
_num_nonzero_blks = _num_nonzero_objects;
} else {
// Compute blocked land mask. A block is considered land, when all its
// grid points are land, otherwise it is considered to be sea. The
// convention is that sea data points will have a positive value and
// land points a zero value.
_land_mask_blk.resize(_num_blks, 0);
for (int i = 0; i < _num_objects; i++) {
int local_0 = (i / _local_ext_1) / _blk_factor_1;
int local_1 = (i % _local_ext_1) / _blk_factor_1;
if (_land_mask[i] > 0) {
_land_mask_blk[local_0 * _local_ext_blk_1 + local_1] = 1;
_num_nonzero_objects++;
}
}
for (int i = 0; i < _num_blks; i++) {
// The convention is that sea data points will have a positive value
// and land points a zero value
if (_land_mask_blk[i] > 0) {
int local_0 = i / _local_ext_blk_1;
int local_1 = i % _local_ext_blk_1;
int global_0 = local_0 + _global_blk_0;
int global_1 = local_1 + _global_blk_1;
_object_id.push_back(global_0 * _global_ext_blk_1 + global_1);
_sparse_to_dense.push_back(i);
_num_nonzero_blks++;
}
}
}
} else {
_num_nonzero_objects = _num_objects;
_num_nonzero_blks = _num_blks;
for (int i = 0; i < _num_blks; i++) {
int local_0 = i / _local_ext_blk_1;
int local_1 = i % _local_ext_blk_1;
int global_0 = local_0 + _global_blk_0;
int global_1 = local_1 + _global_blk_1;
_object_id.push_back(global_0 * _global_ext_blk_1 + global_1);
}
}
NC_CHECK(nc_close(nc_id));
}
int Grid::get_global_ext_0() const { return _global_ext_blk_0; }
int Grid::get_global_ext_1() const { return _global_ext_blk_1; }
int Grid::get_global_ext_orig_0() const { return _global_ext_0; }
int Grid::get_global_ext_orig_1() const { return _global_ext_1; }
int Grid::get_blk_factor_0() const { return _blk_factor_0; }
int Grid::get_blk_factor_1() const { return _blk_factor_1; }
int Grid::get_num_objects() const { return _num_blks; }
int Grid::get_num_nonzero_objects() const { return _num_nonzero_blks; }
int Grid::get_num_procs_0() const { return _num_procs_0; }
int Grid::get_num_procs_1() const { return _num_procs_1; }
const int* Grid::get_land_mask() const
{
if (_blk_factor_0 == 1 && _blk_factor_1 == 1) {
return _land_mask.data();
} else {
return _land_mask_blk.data();
}
}
const int* Grid::get_sparse_to_dense() const { return _sparse_to_dense.data(); }
const int* Grid::get_nonzero_object_ids() const { return _object_id.data(); }
void Grid::get_bounding_box(int& global_0, int& global_1, int& local_ext_0, int& local_ext_1) const
{
global_0 = _global_blk_0;
global_1 = _global_blk_1;
local_ext_0 = _local_ext_blk_0;
local_ext_1 = _local_ext_blk_1;
}