Hybrid Programming

Author: ienesaydogdu

hybrid_hello.c

@@ -0,0 +1,24 @@
+#include <stdio.h>
+#include "mpi.h"
+#include "omp.h"
+
+int main (void) {
+
+int rank, tid, size, provided;
+
+MPI_Init_thread(NULL, NULL, MPI_THREAD_FUNNELED, &provided);
+
+MPI_Comm_rank(MPI_COMM_WORLD, &rank);
+MPI_Comm_size(MPI_COMM_WORLD, &size);
+
+#pragma omp parallel private(tid) 
+{
+     tid = omp_get_thread_num();
+     printf("Hello from thread %d of process %d\n", tid, rank);
+}
+
+MPI_Finalize();
+
+return 0;
+
+}

hybrid_pi.c

@@ -0,0 +1,49 @@
+#include <stdio.h>
+#include "mpi.h"
+#include "omp.h"
+
+double f( double x ) { 
+     return 4.0 / ( 1.0 + x * x);
+}
+
+void printArray(int d[],int n, int r){
+    int j;
+    for(j=0;j<n;j++){
+        printf("rank = %d -----> %d\n",r, d[j]);
+    }
+}
+
+int main(void){
+    int rank,tid,size,provided;
+    MPI_Init_thread(NULL,NULL,MPI_THREAD_FUNNELED,&provided);
+    MPI_Comm_rank(MPI_COMM_WORLD,&rank);
+    MPI_Comm_size(MPI_COMM_WORLD,&size);
+    double dizi[3200]={0}, yeniDizi[800]={0};
+    int i;
+    if(rank == 0){
+        for(i=0;i<3200;i++){
+            dizi[i]=(double)i/3200.0;
+        }
+    }
+
+    double toplam = 0.0, sonuc = 0.0;
+
+    MPI_Scatter(dizi,800,MPI_DOUBLE,yeniDizi,800,MPI_DOUBLE,0,MPI_COMM_WORLD);
+
+    #pragma omp parallel shared(toplam) private(i)
+    {
+            #pragma omp for schedule(static) reduction(+:toplam)
+                for(i = 0; i < 800; i++)
+                    toplam += f( yeniDizi[i] );  
+                
+    }
+    
+    MPI_Reduce( &toplam, &sonuc, 1, MPI_DOUBLE, MPI_SUM, 0, MPI_COMM_WORLD );
+
+    if( rank == 0 ){
+        printf("Pi = %f\n", sonuc / 3200.0);
+    }
+
+    MPI_Finalize();
+    return 0;
+}

mpi_thread_funneled.c

@@ -0,0 +1,62 @@
+#include <stdio.h>
+#include "mpi.h"
+#include "omp.h"
+
+void printArray(int d[], int n, int r) {
+     int j;
+     for (j = 0; j < n; j++)
+          printf("rank = %d --> %d\n", r, d[j]);
+}
+
+int main (void) {
+
+int rank, tid, size, provided, toplam;
+MPI_Status status;
+
+MPI_Init_thread(NULL, NULL, MPI_THREAD_FUNNELED, &provided);
+
+MPI_Comm_size(MPI_COMM_WORLD, &size);
+MPI_Comm_rank(MPI_COMM_WORLD, &rank);
+
+int dizi[20] = { 0 };
+int i;
+
+if ( rank == 0 ) {
+     for (i = 0; i < 20; i++)
+          dizi[i] = i + 1;
+}
+
+printArray(dizi, 20, rank);
+
+#pragma omp parallel
+{
+     if (rank == 0) {
+          #pragma omp master
+               MPI_Send(dizi, 20, MPI_INT, 1, 777, MPI_COMM_WORLD);
+          #pragma omp barrier
+     } else {
+          #pragma omp master
+               MPI_Recv(dizi, 20, MPI_INT, 0, 777, MPI_COMM_WORLD, &status);
+          #pragma omp barrier
+     }
+}
+
+// puts(""); puts("");
+// printArray(dizi, 20, rank);
+
+if ( rank == 1 ) {
+     #pragma omp parallel private(i) shared(toplam)
+     {
+          #pragma omp for schedule(static) reduction(+:toplam)
+               for (i = 0; i < 20; i++)
+                    toplam += dizi[i];
+     }
+
+     printf("Toplam = %d\n", toplam);
+}
+
+MPI_Finalize();
+
+return 0;
+
+}

multiple_hybrid.c

@@ -0,0 +1,51 @@
+#include <stdio.h>
+#include "mpi.h"
+#include "omp.h"
+#define TAG 777
+
+void printArray(int d[], int n, int r) {
+     int j;
+     for (j = 0; j < n; j++)
+          printf("rank = %d --> %d\n", r, d[j]);
+}
+
+int main (void) {
+
+int rank, tid, size, provided, toplam;
+MPI_Status status;
+
+MPI_Init_thread(NULL, NULL, MPI_THREAD_MULTIPLE, &provided);
+
+MPI_Comm_size(MPI_COMM_WORLD, &size);
+MPI_Comm_rank(MPI_COMM_WORLD, &rank);
+
+int dizi[20] = { 0 };
+int yeniDizi[5] = { 0 };
+int i;
+
+if ( rank == 0 ) {
+     for (i = 0; i < 20; i++)
+          dizi[i] = i + 1;
+}
+
+#pragma omp parallel private(tid, i)
+{
+     tid = omp_get_thread_num();
+     if (rank == 0)     
+          MPI_Send(&dizi[5*tid], 5, MPI_INT, 1, TAG + tid, MPI_COMM_WORLD);
+     else
+          MPI_Recv(yeniDizi, 5, MPI_INT, 0, TAG + tid, MPI_COMM_WORLD, &status);
+     if ( rank == 1 )
+          for (i = 0; i < 5; i++)
+               printf("P %d,   T %d --> yeniDizi[%d] = %d\n", rank, tid, i, yeniDizi[i]);
+}
+
+MPI_Finalize();
+
+return 0;
+
+}
+
+
+
+

openmp.c

@@ -0,0 +1,53 @@
+#include <stdio.h>
+#include "mpi.h"
+#include "omp.h"
+#define TAG 777
+
+void printArray(int d[], int n, int r) {
+     int j;
+     for (j = 0; j < n; j++)
+          printf("rank = %d --> %d\n", r, d[j]);
+}
+
+int main (void) {
+
+int rank, tid, size, provided, toplam;
+MPI_Status status;
+
+MPI_Init_thread(NULL, NULL, MPI_THREAD_MULTIPLE, &provided);
+
+MPI_Comm_size(MPI_COMM_WORLD, &size);
+MPI_Comm_rank(MPI_COMM_WORLD, &rank);
+
+int dizi[20] = { 0 };
+int yeniDizi[5] = { 0 };
+int i;
+
+if ( rank == 0 ) {
+     for (i = 0; i < 20; i++)
+          dizi[i] = i + 1;
+}
+
+#pragma omp parallel private(tid, i)
+{
+     tid = omp_get_thread_num();
+     if (rank == 0)     
+          MPI_Send(&dizi[5*tid], 5, MPI_INT, 1, TAG + tid, MPI_COMM_WORLD);
+     else
+          MPI_Recv(yeniDizi, 5, MPI_INT, 0, TAG + tid, MPI_COMM_WORLD, &status);
+     if ( rank == 1 )
+          for (i = 0; i < 5; i++)
+               printf("P %d,   T %d --> yeniDizi[%d] = %d\n", rank, tid, i, yeniDizi[i]);
+}
+
+MPI_Finalize();
+
+return 0;
+
+}
+
+
+
+
+
+