【无标题】

李泰洛

已于 2022-11-09 18:58:18 修改

阅读量65

点赞数

文章标签： python

于 2022-11-09 18:52:07 首次发布

原文链接：https://blog.csdn.net/XX_123_1_RJ/article/details/39502663?utm_medium=distribute.pc_relevant.none-task-blog-2~default~baidujs_baidulandingword~default-1-39502663-blog-105740885.pc_relevant_3mothn_strategy_recovery&spm=1001.2101.3001.4242.2&utm_relevant_in

版权

该博客展示了如何使用OpenMP进行多线程编程计算π的近似值，并通过与串行计算的对比，探讨了并行计算的效率提升。博主通过设置不同数量的线程，计算了大量迭代步长下的π值，最后给出了并行计算和串行计算的时间消耗，以展示并行计算的优势。

摘要由CSDN通过智能技术生成

// sectionspi.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include "windows.h"
#include <time.h>
#include "omp.h"

static long num_steps = 100000000000;
double step;
#define NUM_THREADS 4

int _tmain(int argc, _TCHAR* argv[])
{
	int i;
	clock_t t1, t2;
	double sum = 0, pi = 0.0;
	step = 1.0 / (double)num_steps;
	omp_set_num_threads(NUM_THREADS);
	t1 = clock();
#pragma omp parallel sections reduction(+:sum)
	{

#pragma omp section
		{
			double x;
			for (int i = omp_get_thread_num(); i <num_steps; i += NUM_THREADS)
			{
				x = (i + 0.5)*step;
				sum = sum + 4.0 / (1.0 + x*x);
			}
		}
#pragma omp section
		{
		double x;
		for (int i = omp_get_thread_num(); i <num_steps; i += NUM_THREADS)
		{
			x = (i + 0.5)*step;
			sum = sum + 4.0 / (1.0 + x*x);
		}
	}
	}
	pi = step * sum;
	t2 = clock();
	printf("pi = %.15f\n", pi);
	printf("parallel time=%d\n", (t2 - t1));
	t1 = clock();
	sum = 0;
	double x;
	for (int i = 0; i <num_steps; i++)
	{
		x = (i + 0.5)*step;
		sum = sum + 4.0 / (1.0 + x*x);
	}
	pi = step * sum;
	t2 = clock();
	printf("pi = %.15f\n", pi);
	printf("serial time=%d\n", (t2 - t1));
	printf("星星笔记\n");
	system("pause");
	return 0;

}

https://blog.csdn.net/Lalgorithm?type=blog