openMP线程数越高,回报越少
openMP Lack of Diminishing Returns with Higher Thread Count
我的代码现在有一个循环,它调用蒙特卡罗函数来计算多个样本的简单积分(y=x,从0到1),并将总时间和积分值写入文本文件。然后循环增加线程数并继续前进。现在大约有8个线程,时间峰值在2.6秒左右。这个循环迭代了64个线程,我看不到超过0.2秒的速度会减慢,有时甚至会加快。
对于循环调用蒙特卡罗方法,增加线程数:
//this loop will iterate the main loop for a number of threads from 1 to 16
for (int j = 1; j <= 17; j++)
{
//tell user how many threads are running monte-carlo currently
cout << "Program is running " << number_threads << " thread(s) currently." << endl;
//reset values for new run
num_of_samples = 1;
integration_result = 0;
//this for loop will run throughout number of circulations running through monte-carlo
//and entering the data into the text folder
for (int i = 1; i <= iteration_num; i++)
{
//call monte carlo function to perform integration and write values to text
monteCarlo(num_of_samples, starting_x, end_x, number_threads);
//increase num of samples for next test round
num_of_samples = 2 * num_of_samples;
} //end of second for loop
//iterate num_threads
if (number_threads == 1)
number_threads = 2;
else if (number_threads >= 32)
number_threads += 8;
else if (number_threads >= 16)
number_threads += 4;
else
number_threads += 2;
} //end of for loop
蒙特卡洛的并行部分:
int num_threads;
double x, u, error_difference, fs = 0, integration_result = 0; //fs is a placeholder to hold added values of f(x)
vector< vector<double>> dataHolder(number_threads, vector<double>(1)); //this vector will hold temp values of each thread
//get start time for parallel block of code
double start_time = omp_get_wtime();
omp_set_dynamic(0); // Explicitly disable dynamic teams
omp_set_num_threads(number_threads); // Use 4 threads for all consecutive parallel regions
#pragma omp parallel default(none) private(x, u) shared(std::cout, end_x, starting_x, num_of_samples, fs, number_threads, num_threads, dataHolder)
{
int i, id, nthrds;
double temp = fs;
//define thread id and num of threads
id = omp_get_thread_num();
nthrds = omp_get_num_threads();
//initilialize random seed
srand(id * time(NULL) * 1000);
//if there is only one thread
if(id == 0)
num_threads = nthrds;
//this for loop will calculate a temp value for fs for each thread
for (int i = id; i < num_of_samples; i = i + nthrds)
{
//assign random number under integration from 0 to 1
u = fRand(0, 1); //random number between 0 and 1
x = starting_x + (end_x - starting_x) * u;
//this line of code is from Monte_Carlo Method by Alex Godunov (February 2007)
//calculuate y for reciporical value of x and add it to thread's local fs
temp += function(x);
}
//place temp inside vector dataHolder
dataHolder[id][0] = temp;
//no thread will go beyond this barrier until task is complete
#pragma omp barrier
//one thread will do this task
#pragma omp single
{
//add summations to calc fs
for(i = 0, fs = 0.0; i < num_threads; i ++)
fs += dataHolder[i][0];
} //implicit barrier here, wait for all tasks to be done
}//end of parallel block of code
在通过光散射的简单蒙特卡罗行走实现了相同类型的并行化之后,我能够在很大程度上获得减少的回报。我认为这里缺乏递减回报,因为积分计算非常简单,线程本身几乎没有什么单独的事情可做,因此它们的开销相对较小。如果其他人有任何其他信息可以证明对这个问题有用,请随时发布。否则,我将接受这一点作为我的答案。
相关文章:
- OpenMP阵列性能较差
- OpenMP卸载说'fatal error: could not find accel/nvptx-none/mkoffload'
- 使用 GCC 卸载的 OpenMP 卸载失败,并出现"Ptx assembly aborted due to errors"
- OpenMP:并行更新数组总是需要减少数组吗
- 如何使用OpenMP并行这两个循环
- 从python调用openMP共享库时,未定义opnMP函数
- 如何使用OpenMP并行化此矩阵时间矢量运算
- 如何使用OpenMP使这个循环并行
- 如何通过替换顺序代码的while循环来添加OpenMP for循环
- 查找最近配对时的OpenMP竞赛条件
- 使用输入打破 OpenMP 中的循环
- 为什么 openmp 的并行不适用于矢量化色彩空间转换?
- 在 openmp 中,omp_get_thread_num是否绑定到物理线程?
- 在C++中使用并行化的预期速度是多少(不是 OpenMp,而是 <thread>)
- OpenMP 加上unordered_map<字符串、双字符串的缩减>
- OpenMP 与有序和关键指令并行
- 我使用 OpenMP 的线程越多,执行时间就越长,这是怎么回事?
- OpenMP for 循环并行性问题
- 两个连续的 OpenMP 并行区域会相互减慢速度
- openMP线程数越高,回报越少