CSC/ECE 506 Spring 2015/37 mr - Revision history

Rrmercer: /* Question 1 */

2015-02-03T04:49:44Z

Question 1

← Older revision		Revision as of 04:49, 3 February 2015
Line 11:		Line 11:
	The code to parallelize:		The code to parallelize:
	int main()		int main()
	{		{
	omp_set_num_threads(6);		omp_set_num_threads(6);
	long sum = 1;		long sum = 1;
Line 26:		Line 26:
	printf("sum: %d\n", sum);		printf("sum: %d\n", sum);
	return 0;		return 0;
	}		}

	== Answer 1 ==		== Answer 1 ==

Rrmercer: /* Question 1 */

2015-02-03T04:49:34Z

Question 1

← Older revision		Revision as of 04:49, 3 February 2015
Line 10:		Line 10:

	The code to parallelize:		The code to parallelize:
	~~#include <stdio.h>~~
	int main()		int main()
	{		{
	int size = 5;		omp_set_num_threads(6);
	int i, j;		long sum = 1;
	int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };		int size = 5;
	~~int second[5][5];~~		int i, j, rowsum;
	~~int shift[5][5];~~		int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };
	~~int sum = 0;~~		for ( i = 0 ; i < size ; i++ ){
	for ( i = 0 ; i < size ; i++ ){		rowsum = 0;
	for ( j = 0 ; j < size ; j++ ){		for ( j = 0 ; j < size ; j++ ){
	~~second~~[i][j~~] = first[j][i~~];		rowsum = rowsum + first[i][j];
	sum = ~~first[j][i] +~~ sum;		}
	~~shift[i][j] = first[j-1][i-1];~~		sum = rowsum*sum;
	}		}
	}		printf("sum: %d\n", sum);
	printf("~~matrix~~:~~-\n");~~		return 0;
	~~for ( i = 0 ; i < size ; i++ )~~		}
	{
	~~for ( j = 0 ; j < size ; j++ )~~
	~~printf("~~%d\t", ~~second[i][j]~~);
	~~printf("\n");~~
	}
	return 0;
	}
	~~Note that this can be done using DOALL with openMP because we created a copy of the matrix!~~

	== Answer 1 ==		== Answer 1 ==

Rrmercer: /* Question 1 */

2015-02-03T04:48:50Z

Question 1

← Older revision		Revision as of 04:48, 3 February 2015
Line 26:		Line 26:
	}		}
	}		}
	printf("~~Transposed~~ matrix:-\n");		printf("matrix:-\n");
	for ( i = 0 ; i < size ; i++ )		for ( i = 0 ; i < size ; i++ )
	{		{

Rrmercer: /* Answer 1 */

2015-02-03T04:47:57Z

Answer 1

← Older revision		Revision as of 04:47, 3 February 2015
Line 56:		Line 56:
	sum = rowsum*sum;		sum = rowsum*sum;
	}		}
			}
	}
	printf("sum: %d\n", sum);		printf("sum: %d\n", sum);
	return 0;		return 0;

Rrmercer: /* Answer 1 */

2015-02-03T04:47:46Z

Answer 1

← Older revision		Revision as of 04:47, 3 February 2015
Line 40:		Line 40:
	int main()		int main()
	{		{
	omp_set_num_threads(4);		omp_set_num_threads(6);
	~~#pragma omp parallel~~		long sum = 1;
	{
	int size = 5;		int size = 5;
	int i, j;		int i, j, rowsum;
			#pragma omp parallel shared(rowsum, i, sum) private(j)
			{
	int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };		int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };
	~~int second[5][5];~~		#pragma omp for
	~~int shift[5][5];~~
	~~int sum = 0;~~
	#pragma omp ~~parallel~~ for ~~default (shared)~~
	for ( i = 0 ; i < size ; i++ ){		for ( i = 0 ; i < size ; i++ ){
			rowsum = 0;
	for ( j = 0 ; j < size ; j++ ){		for ( j = 0 ; j < size ; j++ ){
	~~second[i][j] = first[j][i];~~		rowsum = rowsum + first[i][j];
	~~sum~~ = first~~[j][i] + sum;~~
	~~shift~~[i][j~~] = first[j-1][i-1~~];
	}		}
	}		#pragma omp critical
	~~printf("Transposed matrix:\n");~~		sum = rowsum*sum;
	~~for ( i = 0 ; i < size ; i++ )~~
	{
	~~for ( j = 0 ; j < size ; j++ )~~
	~~printf("%d\t", second[i][j]);~~
	~~printf("\n");~~
	}
	~~printf("Shifted matrix:-\n");~~
	~~for ( i = 0 ; i < size ; i++ )~~
	{
	~~for ( j~~ = ~~0 ; j < size ; j++ )~~
	~~printf("%d\t", shift[i][j]);~~
	~~printf("\n")~~;
	}		}

	}		}
	return 0;		printf("sum: %d\n", sum);
			return 0;
	}		}

Rrmercer: /* Answer 1 */

2015-02-03T03:47:51Z

Answer 1

← Older revision		Revision as of 03:47, 3 February 2015
Line 64:		Line 64:
	printf("\n");		printf("\n");
	}		}
			printf("Shifted matrix:-\n");
			for ( i = 0 ; i < size ; i++ )
			{
			for ( j = 0 ; j < size ; j++ )
			printf("%d\t", shift[i][j]);
			printf("\n");
			}

	}		}
	return 0;		return 0;

Rrmercer: /* Question 1 */

2015-02-03T03:45:00Z

Question 1

← Older revision		Revision as of 03:45, 3 February 2015
Line 11:		Line 11:
	The code to parallelize:		The code to parallelize:
	#include <stdio.h>		#include <stdio.h>

	int main()		int main()
	{		{
Line 36:		Line 35:
	return 0;		return 0;
	}		}
	Note that this can be done using DOALL with openMP because we created a copy of the matrix!		Note that this can be done using DOALL with openMP because we created a copy of the matrix!

	== Answer 1 ==		== Answer 1 ==
	int main()		int main()

Rrmercer at 03:44, 3 February 2015

2015-02-03T03:44:29Z

← Older revision		Revision as of 03:44, 3 February 2015
Line 20:		Line 20:
	int shift[5][5];		int shift[5][5];
	int sum = 0;		int sum = 0;

	for ( i = 0 ; i < size ; i++ ){		for ( i = 0 ; i < size ; i++ ){
	for ( j = 0 ; j < size ; j++ ){		for ( j = 0 ; j < size ; j++ ){
Line 36:		Line 35:
	}		}
	return 0;		return 0;

	}		}
	Note that this can be done using DOALL with openMP because we created a copy of the matrix!		Note that this can be done using DOALL with openMP because we created a copy of the matrix!
Line 51:		Line 49:
	int shift[5][5];		int shift[5][5];
	int sum = 0;		int sum = 0;

	#pragma omp parallel for default (shared)		#pragma omp parallel for default (shared)
	for ( i = 0 ; i < size ; i++ ){		for ( i = 0 ; i < size ; i++ ){

Rrmercer at 03:44, 3 February 2015

2015-02-03T03:44:01Z

← Older revision		Revision as of 03:44, 3 February 2015
Line 6:		Line 6:

	== Question 1 ==		== Question 1 ==
	'''~~Write a C program that will transpose a 5 x 5 matrix and parallelize~~ the ~~resulting~~ code'''		'''Parallelize the following code using OpenMP'''
	----		----

Line 18:		Line 18:
	int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };		int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };
	int second[5][5];		int second[5][5];
			int shift[5][5];
			int sum = 0;

	for ( i = 0 ; i < size ; i++ ){		for ( i = 0 ; i < size ; i++ ){
	for ( j = 0 ; j < size ; j++ ){		for ( j = 0 ; j < size ; j++ ){
	second[i][j] = first[j][i];		second[i][j] = first[j][i];
			sum = first[j][i] + sum;
			shift[i][j] = first[j-1][i-1];
	}		}
	}		}
	printf("Transposed ~~matric~~:-\n");		printf("Transposed matrix:-\n");
	for ( i = 0 ; i < size ; i++ )		for ( i = 0 ; i < size ; i++ )
	{		{
Line 44:		Line 49:
	int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };		int first[5][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 }, {16, 17, 18, 19, 20}, {21, 22, 23, 24, 25} };
	int second[5][5];		int second[5][5];
			int shift[5][5];
			int sum = 0;

	#pragma omp parallel for default (shared)		#pragma omp parallel for default (shared)
	for ( i = 0 ; i < size ; i++ ){		for ( i = 0 ; i < size ; i++ ){
	for ( j = 0 ; j < size ; j++ ){		for ( j = 0 ; j < size ; j++ ){
	second[i][j] = first[j][i];		second[i][j] = first[j][i];
			sum = first[j][i] + sum;
			shift[i][j] = first[j-1][i-1];
	}		}
	}		}

Rrmercer at 03:20, 29 January 2015

2015-01-29T03:20:29Z

@@ Line 1: / Line 1: @@
-# Example 1
+== A (simple) Introduction to OpenMP ==
-# Example 2
+How to run the samples on EOS
 '''Parallelize the code below using loop distribution'''
 ----