系统结构实验二12121469.docxVIP

计算机系统结构实验报告专业：计算机科学与技术指导老师： 雷咏梅 姓名： 钱成浩 学号： 12121469 计算机工程与科学学院实验二 多核环境下OpenMP并行编程实验2-1. OpenMP程序的编译和运行1. 实验目的1) 在Linux平台上编译和运行OpenMP程序；2) 在Windows平台上编译和运行OpenMP程序。3) 掌握OpenMP并行编程基础。2. 实验环境1) 硬件环境：i5双核四线程pc机2) 软件环境：centos6+gcc，以及win8.1+Visual Studio20133. 运行内容代码如下：#include #include int main()int nthreads,tid;omp_set_num_threads(8);#pragma omp parallel private(nthreads,tid)tid=omp_get_thread_num();printf(Hello World from OMP thread %dn,tid);if(tid=0)nthreads=omp_get_num_threads();printf(Number of threads is %dn,nthreads);4. 运行结果linuxWindows实验2-2 矩阵乘法的OpenMP实现及性能分析1. 实验目的1) 用OpenMP实现最基本的数值算法“矩阵乘法”2) 掌握for编译制导语句3) 对并行程序进行简单的性能调优2. 实验要求1） 运行并测试OpenMP编写两个n阶的方阵a和b的相乘程序，结果存放在方阵c中，其中乘法用for编译制导语句实现并行化操作，并调节for编译制导中schedule的参数，使得执行时间最短。要求在window环境（不用虚拟机），在linux环境（用和不用虚拟机情况下）测试程序的性能，并写出详细的分析报告。3.实验内容1. 用OpenMP编写两个n阶的方阵a和b的相乘程序，结果存放在方阵c中，其中乘法用for编译制导语句实现并行化操作，并调节for编译制导中schedule的参数，使得执行时间最短，写出代码。方阵a和b的初始值如下： 输入：方阵的阶n、并行域的线程数输出：c中所有元素之和、程序的执行时间提示：a,b,c的元素定义为int型，c中所有元素之和定义为long long型。Windows计时:用中的clock_t clock( void )函数得到当前程序执行的时间在windows下使用Microsofe Visual Studio编程，源代码如下：#include#include#includevoid comput(float* A, float* B, float* C)/两个矩阵相乘传统方法int x, y;for (y = 0; y4; y+)for (x = 0; x4; x+)C4 * y + x = A4 * y + 0 * B4 * 0 + x + A4 * y + 1 * B4 * 1 + x +A4 * y + 2 * B4 * 2 + x + A4 * y + 3 * B4 * 3 + x;int main()double duration;clock_t s, f;int x = 0;int y = 0;int n = 0;int k = 0;float A = 1, 2, 3, 4,5, 6, 7, 8,9, 10, 11, 12,13, 14, 15, 16 ;float B = 0.1f, 0.2f, 0.3f, 0.4f,0.5f, 0.6f, 0.7f, 0.8f,0.9f, 0.10f, 0.11f, 0.12f,0.13f, 0.14f, 0.15f, 0.16f ;float C16;s = clock();/#pragma omp parallel if(false)for (n = 0; n1000000; n+)comput(A, B, C);f = clock();duration = (double)(f - s) / CLOCKS_PER_SEC;printf(s-1,000,000 :%fn, duration);for (y = 0; y4; y+)for (x = 0; x4; x+)printf(%f, Cy * 4 + x);printf(n);printf(n=n);s = clock();/parallel 2#pragma omp parallel forfor (n = 0; n2; n+)/CPU是核线程的for (k = 0; k500000; k+)/每个线程管个循环comput(A, B, C);f = clock();duration = (double)(f - s) / CLOCKS_PER_SEC;printf(p2- 1,000,000:%fn, duration);/parallel 3s = clock();#pragma omp parallel forfor (n = 0; n4; n+)/CPU是核线程的for (k = 0; k250000; k+)/每个线程管个循环comput(A, B, C);f = clock();duration = (double)(f - s) / CLOCKS_PER_SEC;printf(p3- 1,000,000:%fn, duration);/parallel 1s = clock();#pragma omp parallel forfor (n = 0; n1000000; n+)comput(A, B, C);f = clock();duration = (double)(f - s) / CLOCKS_PER_SEC;printf(p1- 1,000,000 :%fn, duration);for (y = 0; y4; y+)for (x = 0; x4; x+)printf(%f, Cy * 4 + x);printf(n);getchar();return 0;4. 运行结果Linux（shell中运行）Windows线程为2 线程为4线程为82）请自己找一个需要大量计算但是程序不是很长的程序，实现OMP的多线程并行计算，要求写出并行算法，并分析并行的效果（注：必须核对串行和并行的计算结果，保证正确性）运行代码：1 #include2 #include3 #include4 #include5 #include6 using std:cout;7 using std:setprecision;8 using std:endl;9 void derivative(double x,double y,double result)10 11 result = (x + y)*(x + y) - x*x)/y;12 1314 int main()15 16 double duration;17 clock_t s, f;18 int n = 0;19 int k = 0;20 double x = 2.0, y = 0.01;21 double result;22 s = clock();23 #pragma omp parallel if(false)24 for (n = 0; n1000000; n+)25 26 derivative(x, y, result);27 /*for (int i = 0; i 10; +i)28 29 derivative(x, y, result);30 cout setprecision(20) result endl;31 y /= 10;32 */33 34 f = clock();35 duration = (double)(f - s) / CLOCKS_PER_SEC;36 cout s-1000000: duration endl;37 for (int i = 0; i10; +i)38 39 cout setprecision(20) result endl;40 y /= 10;41 42 cout = endl;43 s = clock();44 #pragma omp parallel for45 for (n = 0; n2; n+)46 47 for (k = 0; k500000; k+)48 49 derivative(x, y, result);50 51 52 f = clock();53 duration = (double)(f - s) / CLOCKS_PER_SEC;54 cout p2-1000000: duration endl;55 s = clock();56 #pragma omp parallel for57 for (n = 0; n4; n+)58 59 for (k = 0; k250000; k+)60 61 derivative(x, y, result);62 63 64 f = clock();65 duration = (double)(f - s) / CLOCKS_PER_SEC;6667 cout p3-1000000: duration endl;68 s = clock();69 #pragma omp parallel for70 for (n = 0; n1000000; n+)71 72 derivative(x, y, result);73 74 f = clock();75 duration = (double)(f - s) / CLOCKS_PER_SEC