【发布时间】:2017-10-29 23:54:27
【问题描述】:
我目前正在进行一个项目,其中必须使用 HDF5 创建一个大型数据集。现在,天真的实现一切都很好而且很花哨,但是很慢。慢的部分在计算中(比写入慢 10 倍),我不能再加快速度了,但也许并行化是可能的。
我想我可以使用一个简单的 #pragma omp parallel for 但出于速度原因,dataspace.write(..) 方法应该是顺序的(也许没关系)。以这张图片为例。
需要注意的是,由于维度的原因,write函数使用了一个与缓冲区大小相同的分块布局(实际上是1Mb左右)
/*
------------NAIVE IMPLEMENTATION-----------------
|T:<calc0><W0><calc1><W1><calc2><W2>............|
|-----------------------------------------------|
|----------PARALLEL IMPLEMENTATION--------------|
|-----------------------------------------------|
|T0:<calc0----><W0><calc4>.....<W4>.............|
|T1:<calc1---->....<W1><calc5->....<W5>.........|
|T2:<calc2--->.........<W2>calc6-->....<W6>.....|
|T3:<calc3----->...........<W3><calc7-->...<W7>.|
------------DIFFERENT IMPLEMENTATION-------------
i.e.: Queuesize=4
T0:.......<W0><W1><W2><W3><W4><W5><W6>..........|
T1:<calc0><calc3>.....<calc6>...................|
T2:<calc1>....<calc4>.....<calc7>...............|
T3:<calc2>........<calc5>.....<calc8>...........|
T Thread
<calcn---> Calculation time
<Wn> Write data n. Order *important*
. Waiting
*/
代码示例:
#include <chrono>
#include <cmath>
#include <iostream>
#include <memory>
double calculate(float *buf, const struct options *opts) {
// dummy function just to get a time reference
double res = 0;
for (size_t i = 0; i < 10000; i++)
res += std::sin(i);
return 1 / (1 + res);
}
struct options {
size_t idx[6];
};
class Dataspace {
public:
void selectHyperslab(){}; // selects region in disk space
void write(float *buf){}; // write buf to selected disk space
};
int main() {
size_t N = 6;
size_t dims[6] = {4 * N, 4 * N, 4 * N, 4 * N, 4 * N, 4 * N},
buf_offs[6] = {4, 4, 4, 4, 4, 4};
// dims: size of each dimension, multiple of 4
// buf_offs: size of buffer in each dimension
// Calcuate buffer size and allocate
// the size of the buffer is usually around 1Mb
// and not a float but a compund datatype
size_t buf_size = buf_offs[0];
for (auto off : buf_offs)
buf_size *= off;
std::unique_ptr<float[]> buf{new float[buf_size]};
struct options opts; // options parameters, passed to calculation fun
struct Dataspace dataspace; // dummy Dataspace. Supplied by HDF5
size_t i = 0;
size_t idx0, idx1, idx2, idx3, idx4, idx5;
auto t_start = std::chrono::high_resolution_clock::now();
std::cout << "[START]" << std::endl;
for (idx0 = 0; idx0 < dims[0]; idx0 += buf_offs[0])
for (idx1 = 0; idx1 < dims[1]; idx1 += buf_offs[1])
for (idx2 = 0; idx2 < dims[2]; idx2 += buf_offs[2])
for (idx3 = 0; idx3 < dims[3]; idx3 += buf_offs[3])
for (idx4 = 0; idx4 < dims[4]; idx4 += buf_offs[4])
for (idx5 = 0; idx5 < dims[5]; idx5 += buf_offs[5]) {
i++;
opts.idx[0] = idx0;
opts.idx[1] = idx1;
opts.idx[2] = idx2;
opts.idx[3] = idx3;
opts.idx[4] = idx4;
opts.idx[5] = idx5;
dataspace.selectHyperslab(/**/); // function from HDF5
calculate(buf.get(), &opts); // populate buf with data
dataspace.write(buf.get()); // has to be sequential
}
std::cout << "[DONE] " << i << " calls" << std::endl;
std::chrono::duration<double> diff =
std::chrono::high_resolution_clock::now() - t_start;
std::cout << "Time: " << diff.count() << std::endl;
return 0;
}
代码应该开箱即用。
我已经快速了解了 OpenMP,但我还不能完全理解。谁能给我一个提示/工作示例?我不擅长并行化,但是带有缓冲队列的写入器线程不会工作吗?还是无论如何都使用 OpenMP 矫枉过正而 pthreads 就足够了? 感谢您提供任何帮助,
干杯
【问题讨论】:
-
我怀疑你的例子没有足够的代表性来给出一个好的答案。每个循环迭代是否适用于
buf的不同部分(如opts.idx所示?您是在每次迭代中编写buf的全部内容还是仅在此循环迭代中修改的特定非重叠部分?跨度> -
是的,我试图将其最小化。但是,是的,在迭代期间,每个计算都会完全填满缓冲区。然后它被传递给 write 调用,从而将 buf 的全部内容写入指定位置的磁盘(使用数据空间中的分块布局进行切片)
标签: c++ multithreading c++11 openmp hdf5