TEST_F(MatcherGTest, testLocalMaxMatching) {
count n = 50;
Graph G(n);
G.forNodePairs([&](node u, node v){
G.addEdge(u,v);
});
LocalMaxMatcher localMaxMatcher(G);
TRACE("Start localMax matching");
localMaxMatcher.run();
Matching M = localMaxMatcher.getMatching();
TRACE("Finished localMax matching");
count numExpEdges = n / 2;
bool isProper = M.isProper(G);
EXPECT_TRUE(isProper);
EXPECT_EQ(M.size(G), numExpEdges);
#if !defined _WIN32 && !defined _WIN64 && !defined WIN32 && !defined WIN64
DibapGraphReader reader;
Graph airfoil1 = reader.read("input/airfoil1.gi");
LocalMaxMatcher lmm(airfoil1);
lmm.run();
M = lmm.getMatching();
isProper = M.isProper(airfoil1);
EXPECT_TRUE(isProper);
DEBUG("LocalMax on airfoil1 produces matching of size: " , M.size(G));
#endif
}
int main (int argc, char **argv)
{
struct arguments arguments;
/* Parse our arguments; every option seen by parse_opt will
be reflected in arguments. */
argp_parse (&argp, argc, argv, 0, 0, &arguments);
//matrix size, mxm
int m;
m = 4;
if (sscanf (arguments.args[0], "%i", &m)!=1) {}
// printf("%d",m);
//verbose?
int verbose;
verbose = arguments.verbose;
// Initialize the MPI environment
MPI_Init(NULL, NULL);
// Get the number of processes
int world_size;
MPI_Comm_size(MPI_COMM_WORLD, &world_size);
// Get the rank of the process
int world_rank;
MPI_Comm_rank(MPI_COMM_WORLD, &world_rank);
// Get the name of the processor
char processor_name[MPI_MAX_PROCESSOR_NAME];
int name_len;
MPI_Get_processor_name(processor_name, &name_len);
//Create new column derived datatype
MPI_Datatype column;
//count, blocklength, stride, oldtype, *newtype
MPI_Type_hvector(m, 1, m*sizeof(double), MPI_DOUBLE, &column);
MPI_Type_commit(&column);
//Create new row derived datatype
MPI_Datatype row;
//count, blocklength, stride, oldtype, *newtype
MPI_Type_hvector(m, 1, sizeof(double), MPI_DOUBLE, &row);
MPI_Type_commit(&row);
int q; //q^2=p
q = (int)sqrt(world_size);
// Check constraints
if (m%q!=0 || q*q!=world_size)
{
if (world_rank == 0)
{
printf("Assume that P=q2, where q is an integer s.t. q evenly divides n.\n");
}
exit(0);
}
//row communicator
MPI_Comm my_row_comm;
int my_row;
my_row = world_rank/q;
MPI_Comm_split(MPI_COMM_WORLD, my_row, world_rank, &my_row_comm);
//column communicator
MPI_Comm my_col_comm;
int my_col;
my_col = world_rank%q;
MPI_Comm_split(MPI_COMM_WORLD, my_col, world_rank, &my_col_comm);
// printf("WR=%d, Row=%d, Col=%d\n",world_rank,my_row,my_col);
//counters
int i, j, k;
//Allocate matrices
//Individual Matrix Size = n/q x n/q
int i_size = m/q;
// if (world_rank == 0)
// {
// printf("i_size = %dx%d\n",i_size,i_size);
// }
// //Dynamically allocate matrix parts
// double **m_A = malloc(sizeof(*m_A)*i_size);
// double **m_B = malloc(sizeof(*m_B)*i_size);
// double **m_C = malloc(sizeof(*m_C)*i_size);
// double **t_A = malloc(sizeof(*t_A)*i_size);
// double **t_B = malloc(sizeof(*t_B)*i_size);
// if (m_A)
// {
// for(i=0;i<i_size;i++)
// {
// m_A[i] = malloc(sizeof(*m_A)*i_size);
// m_B[i] = malloc(sizeof(*m_B)*i_size);
// m_C[i] = malloc(sizeof(*m_C)*i_size);
// t_A[i] = malloc(sizeof(*t_A)*i_size);
// t_B[i] = malloc(sizeof(*t_B)*i_size);
// }
// }
//Dynamically allocate arrays
double *m_A;
m_A = (double*) malloc(i_size*i_size*sizeof(double));
double *m_B;
m_B = (double*) malloc(i_size*i_size*sizeof(double));
double *m_C;
m_C = (double*) malloc(i_size*i_size*sizeof(double));
double *t_A;
t_A = (double*) malloc(i_size*i_size*sizeof(double));
double *t_B;
t_B = (double*) malloc(i_size*i_size*sizeof(double));
//Find distance between blocks
int stride = i_size*i_size*sizeof(double);
//Timing variables
double total_time;
total_time = 0;
double starttime, endtime;
double alltime[50] = {0};
int kk;
for (kk=0; kk<60; kk++)
{
//Fill matrix parts with data
for (i=0;i<i_size;i++)
{
for (j=0;j<i_size;j++)
{
m_A[i*i_size+j] = j;
m_B[i*i_size+j] = j;
m_C[i*i_size+j] = 0;
t_A[i*i_size+j] = 0;
t_B[i*i_size+j] = 0;
}
}
if (kk>=10)
{
starttime = MPI_Wtime();
}
// //Debug: printing initial part of matrix
// if (world_rank == 0)
// {
// printf("Initial matrix part for each process:\n");
// print_matrix(i_size, m_A);
// }
int dest;
dest = (my_row + q - 1) % q;
int source;
source = (my_row + 1) % q;
int stage;
int k_bar;
int bcast_root;
MPI_Status status;
for (stage=0;stage<q;stage++)
{
k_bar = (my_row + stage) % q;
bcast_root = (my_row + stage) % q;
if (bcast_root == my_col)
{
//int MPI_Bcast( void *buffer, int count, MPI_Datatype datatype,
// int root, MPI_Comm comm )
MPI_Bcast(m_A, i_size*i_size, MPI_DOUBLE, bcast_root,
my_row_comm);
//local matrix multiply
lmm(i_size, m_A, m_B, m_C);
}
else
{
MPI_Bcast(t_A, i_size*i_size, MPI_DOUBLE, bcast_root,
my_row_comm);
// //debug printing matrices
// if (world_rank == 1)
// {
// print_matrix(i_size, t_A);
// }
// if (world_rank == 1)
// {
// print_matrix(i_size, m_C);
// }
//local matrix multiply
lmm(i_size, t_A, m_B, m_C);
// if (world_rank == 1)
// {
// print_matrix(i_size, m_C);
// }
}
MPI_Sendrecv_replace(m_B, i_size*i_size, MPI_DOUBLE, dest, 0,
source, 0, my_col_comm, &status);
}
if (kk>=10)
{
endtime = MPI_Wtime();
total_time = total_time + endtime - starttime;
alltime[kk-10] = endtime - starttime;
}
}
MPI_Barrier(MPI_COMM_WORLD);
// printf("Data %d, world rank %d\n", buffer[0], world_rank);
if (world_rank == 0)
{
int i;
for(i=0; i<50; i++)
{
if (i < 49)
{
printf("%2.9f,", alltime[i]);
}
else
{
printf("%2.9f", alltime[i]);
}
}
printf("\n%2.9f\n", total_time/50);
}
MPI_Barrier(MPI_COMM_WORLD);
free(m_A);
free(m_B);
free(m_C);
free(t_A);
free(t_B);
MPI_Finalize();
exit (0);
}