OpenMP Sections
来源:互联网 发布:软件下载站模板 编辑:程序博客网 时间:2024/06/05 18:29
const int N = 10000000;int i = 0;float *a = new float[N];float *b = new float[N];float *c = new float[N];for(i = 0; i < N; i++) a[i] = b[i] = i * 1.0;// 开始并行区域#pragma omp parallel shared (a, b, c) private(i) { // 开始工作分区#pragma omp sections nowait {#pragma omp section for(i = 0; i < N / 2; i++) c[i] = a[i] + b[i];#pragma omp section for(i = N / 2; i < N; i++) c[i] = a[i] + b[i]; }// 结束工作分区 }// 结束并行区域
阅读全文
0 0
- OpenMP Sections
- OpenMP Sections
- OpenMP: sections分段并行
- OpenMP: sections分段并行
- OpenMp之sections用法
- Openmp入门(2)(for + sections)
- OpenMP之数值积分(求圆周率Pi)(sections)
- openmp 快速入门 常用技巧 parallel for sections reduction critical
- OpenMP 之 sections 求素数、求和、求积分圆周率(星星笔记)
- OpenMP
- OpenMP
- openmp
- OpenMP
- openMP
- OpenMp
- OpenMP
- OpenMP
- OpenMP
- (牛客网)跳台阶
- 康托展开
- hadoop平台下Mahout安装与配置
- 微信,该文件已过期或已被清理
- 称金币问题: 有27枚金币,其中一个是假的。假的比真的略轻。现在有一个天平,问最少几次可以找出假币?
- OpenMP Sections
- 哈夫曼编码的实现
- 第十四周:[leetCode] 120. Triangle
- 密码分类
- Java 虚拟机基本结构
- proxmox VE 4.4 增加USB 重定向功能
- [Leetcode] 160. Intersection of Two Linked Lists 解题报告
- python的 @staticmethod,@classmethod和@property的区别
- Pushing the Limits of Deep CNNs for Pedestrian Detection