#include <chrono>
#include <cstdlib>
#include <iostream>
#include <sys/mman.h>
#include <sys/wait.h>
#include "prolificScheduler.hpp"
#include "collectiveScheduler.hpp"

using namespace std;
using namespace std::chrono;

int main(){

	int n= 10;
	size_t size=n * n * sizeof(double);

	//δεσμευση κοινησ μνημης
	double* A=(double*)mmap(NULL, size, PROT_READ| PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1,0);

	srand(time(NULL));
	for (int i=0; i< n*n; i++){
		A[i]= (rand() % 2001)-1000.0;
		}

	cout <<"Sorting A(n,n):"<<endl;
	ProlificScheduler prolific;
	prolific.execute(n,n,n,A);

	cout<< "A(n,n):" <<endl;
	munmap(A, size);


return 0;
};