Skip to content

Instantly share code, notes, and snippets.

View SRatna's full-sized avatar

Sushanta Ratna Adhikari SRatna

  • Virtual Retail GmbH
  • Siegen, Germany
View GitHub Profile
#include <iostream>
#include <iomanip>
#include <math.h>
#include <sys/time.h>
#include <pthread.h>
using namespace std;
extern double getTime();
extern double f1();
#include <iostream>
#include <iomanip>
#include <stdlib.h>
#include <sys/time.h>
#include <pthread.h>
#include <errno.h>
#define MINSIZE 2000000
using namespace std;
void *quicksort(void *);
/***************************************************************************
* Loop Parallelization
*
* Examine the loops below and check, if they can be parallelized.
* If so, parallelize these loops. Then run the program with 4 threads.
* It checks whether the result is the same as in the sequential version.
***************************************************************************/
/* Do not change the following declarations! */
#define N 1000
/***************************************************************************
* Numerical Integration *
***************************************************************************/
#include <iostream>
#include <iomanip>
#include <stdlib.h>
#include <math.h>
#include <sys/time.h>
#include <omp.h>
/*************************************************************************
** Iterative solver: Jacobi method
**
** Author: RW
**
*************************************************************************/
#include <iostream>
#include <stdlib.h>
#include <math.h>
/*************************************************************************
** Iterative solver: Gauss/Seidel method
**
** Author: RW
**
*************************************************************************/
#include <stdlib.h>
#include <math.h>
#include <stdlib.h>
#include <sys/time.h>
#include <string>
#include <iostream>
#include <fstream>
#include "converter.h"
#include "config.h"
#include "bfsqueue.h"