Write a multithreaded program that calculates pi using the above formula by dividing the iterations in...

  

Transcribed Image Text:

Write a multithreaded program that calculates pi using the above formula by dividing the iterations in the for loop among the threads. To simplify the computations, let's assume that the number of working threads is 2 and n=1000000. After the two working threads split the iterations and each thread has its own local sum, they update the global variable sum, and the parent thread will output the sum (i.e., pi estimation) once the workers have exited. Note that if there is a critical section, you need to protect it from the race condition. Option 2. 7=41- 1 1 + for (i = 0; i<n; i++) { if(i82==0) factor=1; factor=-1; sum += factor/(2*1+1); } pi= 4.0 sum; else 1 5 7 This formula is used for computing pi(a), and it takes a lot of terms on the right-hand side before pi value is very accurate. Meaning that the bigger the n, the more accurate the pi estimation. The following serial code uses this formula: ++ (−1)²2_¹ 2n+1 Write a multithreaded program that calculates pi using the above formula by dividing the iterations in the for loop among the threads. To simplify the computations, let's assume that the number of working threads is 2 and n=1000000. After the two working threads split the iterations and each thread has its own local sum, they update the global variable sum, and the parent thread will output the sum (i.e., pi estimation) once the workers have exited. Note that if there is a critical section, you need to protect it from the race condition. Option 2. 7=41- 1 1 + for (i = 0; i<n; i++) { if(i82==0) factor=1; factor=-1; sum += factor/(2*1+1); } pi= 4.0 sum; else 1 5 7 This formula is used for computing pi(a), and it takes a lot of terms on the right-hand side before pi value is very accurate. Meaning that the bigger the n, the more accurate the pi estimation. The following serial code uses this formula: ++ (−1)²2_¹ 2n+1 Write a multithreaded program that calculates pi using the above formula by dividing the iterations in the for loop among the threads. To simplify the computations, let's assume that the number of working threads is 2 and n=1000000. After the two working threads split the iterations and each thread has its own local sum, they update the global variable sum, and the parent thread will output the sum (i.e., pi estimation) once the workers have exited. Note that if there is a critical section, you need to protect it from the race condition. Option 2. 7=41- 1 1 + for (i = 0; i<n; i++) { if(i82==0) factor=1; factor=-1; sum += factor/(2*1+1); } pi= 4.0 sum; else 1 5 7 This formula is used for computing pi(a), and it takes a lot of terms on the right-hand side before pi value is very accurate. Meaning that the bigger the n, the more accurate the pi estimation. The following serial code uses this formula: ++ (−1)²2_¹ 2n+1 Write a multithreaded program that calculates pi using the above formula by dividing the iterations in the for loop among the threads. To simplify the computations, let's assume that the number of working threads is 2 and n=1000000. After the two working threads split the iterations and each thread has its own local sum, they update the global variable sum, and the parent thread will output the sum (i.e., pi estimation) once the workers have exited. Note that if there is a critical section, you need to protect it from the race condition. Option 2. 7=41- 1 1 + for (i = 0; i<n; i++) { if(i82==0) factor=1; factor=-1; sum += factor/(2*1+1); } pi= 4.0 sum; else 1 5 7 This formula is used for computing pi(a), and it takes a lot of terms on the right-hand side before pi value is very accurate. Meaning that the bigger the n, the more accurate the pi estimation. The following serial code uses this formula: ++ (−1)²2_¹ 2n+1

Answer rating: 100% (QA)

include include define NUMBEROFTHREADS 2 define N 1000000 double sum 00 pthreadmutext mutex void calculatePIvoid threadNumber long tNum longthreadNumb... View the full answer