OpenMP

orestespap · web-flow · commit 17a4ca197b98 · 2023-03-16T18:26:07.000-07:00
diff --git a/charfreq_mp.c b/charfreq_mp.c
@@ -0,0 +1,57 @@
+#include<stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#include <omp.h>
+#include <ctype.h>
+
+int main(int argc, char* argv[])
+{   
+
+    char* buffer; 
+    char keyChar='a';
+    char fileName[40];
+    long length;
+    int threadCount=strtol(argv[1],NULL,10),count=0; 
+    
+    FILE *fp;
+    
+    printf("Type in file name: \n");
+    scanf("%s",fileName);
+    fp = fopen ( fileName, "rb" );
+    if( !fp ) perror(fileName),exit(1);
+
+    fseek( fp , 0L , SEEK_END);
+    length = ftell( fp );
+    rewind( fp );
+
+    fp = fopen ( fileName, "rb" );
+    if( !fp ) perror(fileName),exit(1);
+
+    /* allocate memory for entire content */
+    buffer = calloc( 1, length+1 );
+    if( !buffer ) fclose(fp),fputs("memory alloc fails",stderr),exit(1);
+
+    /* copy the file into the buffer */
+    if( 1!=fread( buffer , length, 1 , fp) )
+      fclose(fp),free(buffer),fputs("entire read fails",stderr),exit(1);
+    
+  
+    time_t begin,end;
+    begin = time(NULL);
+    
+
+   # pragma omp parallel for num_threads(threadCount)\
+        reduction(+: count)
+        for (int i=0;i<length;i++)
+            if (buffer[i]==keyChar || tolower(buffer[i])==keyChar)
+                count++;
+    free(buffer);
+    
+    end = time(NULL);
+    
+    printf("Text length: %ld\nChar '%c' frequency in %s: %d\n",length,keyChar, fileName, count);
+    double elapsedTime = end-begin;
+    printf("Elapsed time (seconds): %.2f\n",elapsedTime);
+    
+    return 0;
+}
diff --git a/countSort_mp.c b/countSort_mp.c
@@ -0,0 +1,84 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <omp.h>
+#include <unistd.h>
+#include <sched.h>
+#include <sys/sysinfo.h>
+#include <math.h>
+#include <time.h>
+
+
+
+
+void parallelCountSort(int* inputVector, int* countVector, int size, int chunkSize);
+
+
+int main(int argc, char* argv[])
+{
+
+	int threadCount, size;
+	int* inputVector;
+	int* countVector;
+	time_t begin,end;
+	threadCount=strtol(argv[1],NULL,10);
+	
+	printf("Type in array size: \n");
+	scanf("%d",&size);
+
+
+	if (size%threadCount!=0 && threadCount>1){
+		printf("Array size MOD number of processes must be zero or number of processes equal to one.\n");
+		return 0;	
+	}
+
+	
+	inputVector= malloc(size*sizeof(int));
+	countVector = malloc(size*sizeof(int));
+	
+	int chunkSize=size/threadCount;
+	
+	
+	for (int i=0; i<size;i++){
+		inputVector[i]=rand()%1000;
+		countVector[i]=-1;
+		//printf("%d.) %d\n",i+1,inputVector[i]); //for testing purposes
+	}
+
+	begin=time(NULL);
+	
+	# pragma omp parallel num_threads(threadCount)	
+	parallelCountSort(inputVector,countVector,size,chunkSize);
+
+	end = time(NULL);
+	double elapsedTime = end-begin;
+	printf("Elapsed time (seconds): %.2f\n",elapsedTime);
+	// printf("Vector sorted\n");
+	// for(int i=0;i<size;i++)
+	// 	printf("%d.) %d\n",i+1,inputVector[i]);
+
+
+	free(inputVector);
+	free(countVector);
+	return 0;
+}
+
+void parallelCountSort(int* inputVector, int* countVector, int size, int chunkSize){
+	
+	
+	int myID=omp_get_thread_num(), count;
+	int start=myID*chunkSize;;
+	int end=start+chunkSize;
+
+	for (int i=start;i<end;i++){
+		count=0;
+		for (int j=0;j<size;j++)
+			count+=inputVector[j]<inputVector[i] || (inputVector[j]==inputVector[i] && j<i);
+		countVector[count]=inputVector[i];
+	}
+
+	# pragma omp barrier //enter section once all threads have finished
+	for(int i=0;i<size;i++)
+	 	if (countVector[i]!=-1)
+	 		inputVector[i]=countVector[i];
+}
diff --git a/gaussElimination_mp.c b/gaussElimination_mp.c
@@ -0,0 +1,153 @@
+#include<stdio.h>
+#include <stdlib.h>
+#include<math.h>
+#include <time.h>
+#include <omp.h>
+/*******
+ Function that performs Gauss-Elimination and returns the Upper triangular matrix and solution of equations:
+There are two options to do this in C.
+1. Pass the augmented matrix (a) as the parameter, and calculate and store the upperTriangular(Gauss-Eliminated Matrix) in it.
+2. Use malloc and make the function of pointer type and return the pointer.
+This program uses the first option.
+********/
+void gaussEliminationLS(int m, int n, double** a, double* x, int threadCount);
+void readMatrix(int m, int n, double matrix[m][n]);
+void printMatrix(int m, int n, double matrix[m][n]);
+void copyMatrix(int m, int n, double** matrix1, double** matrix2);
+double** allocateMatrix(int rows, int cols);
+ 
+int main(int argc, char* argv[]){
+    int m,n,threadCount=strtol(argv[1],NULL,10);;
+   
+    printf("Enter the size of the augmeted matrix:\nNo. of rows (m)\n");
+    scanf("%d",&m);
+    printf("No.of columns (n)\n");
+    scanf("%d",&n);
+
+    // if (m%threadCount!=0 && threadCount!=1){
+    //     printf("This application is meant to be run with an even number of processes.\n");
+    //     return 0;
+    // }
+
+    double** a=allocateMatrix(m,n);
+    double* x=malloc(m*sizeof(double));
+    double** U=allocateMatrix(m,n);
+
+    for (int i=0; i<m;i++)
+        for (int j=0;j<n;j++)
+            a[i][j]=rand()%1000;
+    
+
+    //printf("The original matrix is:\n");
+    //printMatrix(m,n,a);
+    //copyMatrix(m,n,a,U);
+    
+    //Perform Gauss Elimination
+    time_t begin,end;
+    begin = time(NULL);
+    gaussEliminationLS(m,n,a,x, threadCount);
+    end = time(NULL);
+    double elapsedTime = end-begin;
+    printf("Elapsed time (seconds): %.2f\n",elapsedTime);
+    // printf("\nThe Upper Triangular matrix after Gauss Eliminiation is:\n\n");
+    // printMatrix(m,n,U);
+    // printf("\nThe solution of linear equations is:\n\n");
+    
+    // for(int i=0;i<n-1;i++)
+    //      printf("x[%d]=\t%lf\n",i+1,x[i]);
+    free(x);
+    free(a);
+    free(U);
+}
+
+
+void gaussEliminationLS(int m, int n, double** a, double* x, int threadCount){
+    int i,j,k;
+    for(i=0;i<m-1;i++){
+        if (i%500==0)
+            printf("Solving ...\n");
+        //Partial Pivoting
+        for(k=i+1;k<m;k++){
+            //If diagonal element(absolute vallue) is smaller than any of the terms below it
+            if(fabs(a[i][i])<fabs(a[k][i])){
+                //Swap the rows
+                for(j=0;j<n;j++){                
+                    double temp;
+                    temp=a[i][j];
+                    a[i][j]=a[k][j];
+                    a[k][j]=temp;
+                }
+            }
+        }
+
+        double term;
+
+        //Begin Gauss Elimination
+        # pragma omp parallel for num_threads(threadCount) private(k,j,term)
+        for(k=i+1;k<m;k++){
+            term=a[k][i]/ a[i][i];
+            for(j=0;j<n;j++){
+                a[k][j]=a[k][j]-term*a[i][j];
+            }
+        }
+         
+    }
+    //Begin Back-substitution
+    for(i=m-1;i>=0;i--){
+        x[i]=a[i][n-1];
+        for(j=i+1;j<n-1;j++){
+            x[i]=x[i]-a[i][j]*x[j];
+        }
+        x[i]=x[i]/a[i][i];
+    }
+             
+}
+/*******
+Function that reads the elements of a matrix row-wise
+Parameters: rows(m),columns(n),matrix[m][n] 
+*******/
+void readMatrix(int m, int n, double matrix[m][n]){
+    int i,j;
+    for(i=0;i<m;i++){
+        for(j=0;j<n;j++){
+            scanf("%lf",&matrix[i][j]);
+        }
+    } 
+}
+/*******
+Function that prints the elements of a matrix row-wise
+Parameters: rows(m),columns(n),matrix[m][n] 
+*******/
+void printMatrix(int m, int n, double matrix[m][n]){
+    int i,j;
+    for(i=0;i<m;i++){
+        for(j=0;j<n;j++){
+            printf("%lf\t",matrix[i][j]);
+        }
+        printf("\n");
+    } 
+}
+/*******
+Function that copies the elements of a matrix to another matrix
+Parameters: rows(m),columns(n),matrix1[m][n] , matrix2[m][n]
+*******/
+void copyMatrix(int m, int n, double** matrix1, double** matrix2){
+    int i,j;
+    for(i=0;i<m;i++){
+        for(j=0;j<n;j++){
+            matrix2[i][j]=matrix1[i][j];
+        }
+    } 
+}
+
+double** allocateMatrix(int rows, int cols)
+{
+        double* arr = malloc(rows*cols*sizeof(double));
+        double** matrix = malloc(rows*sizeof(double*));
+        int i;
+        for(i=0; i<rows; i++)
+        {
+                matrix[i] = &(arr[i*cols]);
+        }
+        return matrix;
+}
diff --git a/stringmatch_mp.c b/stringmatch_mp.c
@@ -0,0 +1,97 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <omp.h>
+#include <unistd.h>
+#include <sched.h>
+#include <sys/sysinfo.h>
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+
+
+int matchString(char* text, char* string, int stringLength, int start, int end);
+
+int main(int argc, char* argv[])
+{
+    char* buffer; 
+    char* keyString="she was";
+    char fileName[40];
+    long length;
+    int threadCount=strtol(argv[1],NULL,10), totalCount=0;
+
+    FILE *fp;
+    
+    printf("Type in file name: \n");
+    scanf("%s",fileName);
+    fp = fopen ( fileName, "rb" );
+    if( !fp ) perror(fileName),exit(1);
+
+    fseek( fp , 0L , SEEK_END);
+    length = ftell( fp );
+    rewind( fp );
+
+    fp = fopen ( fileName, "rb" );
+    if( !fp ) perror(fileName),exit(1);
+
+    /* allocate memory for entire content */
+    buffer = calloc( 1, length+1 );
+    if( !buffer ) fclose(fp),fputs("memory alloc fails",stderr),exit(1);
+
+    /* copy the file into the buffer */
+    if( 1!=fread( buffer , length, 1 , fp) )
+      fclose(fp),free(buffer),fputs("entire read fails",stderr),exit(1);
+    
+    int stringLength =strlen(keyString);
+    time_t begin,end;
+    begin = time(NULL);
+
+    if (threadCount==1)
+        totalCount=matchString(buffer,keyString,stringLength,0,length);
+    else{
+        int chunkSize=length/threadCount;
+        #pragma omp parallel num_threads(threadCount)\
+            reduction(+: totalCount)
+        {
+            int myID=omp_get_thread_num();
+            int start=myID*chunkSize; 
+            int end=start+chunkSize;
+            if (myID==threadCount-1)
+                end+=length%threadCount;
+            
+            totalCount=matchString(buffer,keyString,stringLength,start,end);
+        }
+    }
+
+    free(buffer);    
+   
+    end = time(NULL);
+    
+    printf("File: %s\nText length: %ld\nString pattern \"%s\" matched %d times in text.\n",fileName, length,keyString, totalCount);
+    double elapsedTime = end-begin;
+    printf("Elapsed time (seconds): %.2f\n",elapsedTime);
+    return 0;
+}
+
+
+int matchString(char* text, char* string, int stringLength, int start, int end){
+    int k=0, count=0, l=start;
+
+    while (l<end)
+        if (tolower(text[l])==tolower(string[k])){
+            if(k==stringLength-1){
+                count++;
+                k=0;
+            }
+            else
+                k++;
+            l++;
+        }
+        else{
+            k=0;
+            l++;
+        }
+
+    return count;
+        
+}
