Skip to content

Commit

Permalink
Initial part comm tests
Browse files Browse the repository at this point in the history
Initial part comm test

Initial part comm test

Initial part comm test

Update README.md

Update README.md

Part Comm Unit Test

Signed-off-by: Adriel Poo Armas <[email protected]>
  • Loading branch information
Adriel Poo-Armas authored and adrielpoo committed Aug 9, 2023
1 parent dcc6ec7 commit 80bc444
Show file tree
Hide file tree
Showing 17 changed files with 1,337 additions and 0 deletions.
5 changes: 5 additions & 0 deletions part-comm/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
Partition Communication Unit Test

Test suite for testing different routines, error cases and behavior for Point to Point partition communication

Adriel Poo Armas
82 changes: 82 additions & 0 deletions part-comm/test_commOrder0.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,82 @@
/*Partitions MPI Unit Test
*
* Shows the behavior of the communication when a partitioned recieve call is initialized
* before a partitioned send is declared
* */

#include <stdio.h>
#include <stdlib.h>
#include "mpi.h"
#include "assert.h"

#define PARTITIONS 8
#define COUNT 5

int main (int argc, char *argv[])
{
//Buffer message
double message [PARTITIONS * COUNT];

//MPI variable declarations
int src = 0, dest = 1, tag = 100, flag = 0;
int myrank, provided, i, j;
MPI_Count partitions = PARTITIONS;
MPI_Request request;

//Initializing threaded MPI
MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &provided);
if (provided < MPI_THREAD_SERIALIZED)
MPI_Abort(MPI_COMM_WORLD, EXIT_FAILURE);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);

if (myrank == 0)
{
//This Barrier prevents task 0 to run before the partitioned recieve is initialized in task 1
MPI_Barrier(MPI_COMM_WORLD);

MPI_Psend_init(message, partitions, COUNT, MPI_DOUBLE, dest, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);
MPI_Start(&request);

//Iterating through each buffer partition, filling them and marking them ready to send
for (i = 0; i < partitions; i++)
{
for (j = (i*COUNT); j < ((i+1)*COUNT); j++)
{
message[j] = j+1;
}
MPI_Pready(i, request);
}

//Test for overall send operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}
MPI_Request_free(&request);
}
else if (myrank == 1)
{
MPI_Precv_init(message, partitions, COUNT, MPI_DOUBLE, src, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);
MPI_Start(&request);

//This Barrier allows task 0 to proceed
MPI_Barrier(MPI_COMM_WORLD);

//Test for overall recieve operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}

//Test the buffer to check that the message was recieved correctly
for (i = 0; i < (PARTITIONS * COUNT); i++)
{
assert(message[i] = (i+1));
}
printf("Test Passed Succesfully\n");
MPI_Request_free(&request);
}
MPI_Finalize();
return 0;
}

83 changes: 83 additions & 0 deletions part-comm/test_commOrder1.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,83 @@
/*Partitions MPI Unit Test
*
* Shows the behavior of the communicattion when a partitioned send call completes
* before a partitioned recieve call is declared
*/

#include <stdio.h>
#include <stdlib.h>
#include "mpi.h"
#include "assert.h"

#define PARTITIONS 8
#define COUNT 5

int main (int argc, char *argv[])
{
//Buffer message
double message [PARTITIONS * COUNT];

//MPI variable declaration
int src = 0, dest = 1, tag = 100, flag = 0;
int myrank, provided, i, j;
MPI_Count partitions = PARTITIONS;
MPI_Request request;

//Initializing threaded MPI
MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &provided);
if (provided < MPI_THREAD_SERIALIZED)
MPI_Abort(MPI_COMM_WORLD, EXIT_FAILURE);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);

if (myrank == 0)
{
MPI_Psend_init(message, partitions, COUNT, MPI_DOUBLE, dest, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);
MPI_Start(&request);

//Iterating through each buffer partition, filling them and marking them ready to send
for (i = 0; i < partitions; i++)
{
for (j = (i*COUNT); j < ((i+1)*COUNT); j++)
{
message[j] = j+1;
}
MPI_Pready(i, request);
}

//Test for overall send operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}

//This Barrier allows task 1 to proceed
MPI_Barrier(MPI_COMM_WORLD);

MPI_Request_free(&request);
}
else if (myrank == 1)
{
//This Barrier prevents the task 1 to run before the partitioned send completes
MPI_Barrier(MPI_COMM_WORLD);

MPI_Precv_init(message, partitions, COUNT, MPI_DOUBLE, src, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);
MPI_Start(&request);

//Test for overall recieve operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}

//Test the buffer to check that the message was recieved correctly
for (i = 0; i < (PARTITIONS * COUNT); i++)
{
assert(message[i] == (i+1));
}
printf("Test Passed Succesfully\n");
MPI_Request_free(&request);
}
MPI_Finalize();
return 0;
}

83 changes: 83 additions & 0 deletions part-comm/test_commOrder2.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,83 @@
/*Partitions MPI Unit Test
*
* Shows the behavior of the communication when a send / recv partitioned corridor
* is created and initialized before operations starts.
*/

#include <stdio.h>
#include <stdlib.h>
#include "mpi.h"
#include "assert.h"

#define PARTITIONS 8
#define COUNT 5

int main (int argc, char *argv[])
{
//Buffer message
double message [PARTITIONS * COUNT];

//MPI variables declaration
int src = 0, dest = 1, tag = 100, flag = 0, flag2 = 0;
int myrank, provided, i, j;
MPI_Count partitions = PARTITIONS;
MPI_Request request;

//Initializing threaded MPI
MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &provided);
if (provided < MPI_THREAD_SERIALIZED)
MPI_Abort(MPI_COMM_WORLD, EXIT_FAILURE);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);

if (myrank == 0)
{
MPI_Psend_init(message, partitions, COUNT, MPI_DOUBLE, dest, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);

MPI_Start(&request);

//This Barrier ensures that a send/recv is establish before proceeding
MPI_Barrier(MPI_COMM_WORLD);

//Iterating through each buffer partition, filling them and marking them ready to send
for (i = 0; i < partitions; i++)
{
for (j = (i*COUNT); j < ((i+1)*COUNT); j++)
{
message[j] = j+1;
}
MPI_Pready(i, request);
}

//Test for overall send operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}
MPI_Request_free(&request);
}
else if (myrank == 1)
{
MPI_Precv_init(message, partitions, COUNT, MPI_DOUBLE, src, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);
MPI_Start(&request);

//This Barrier ensures that a send/recv is establish before proceeding
MPI_Barrier(MPI_COMM_WORLD);

//Test for overall recieve operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}

//Test the buffer to check that the message was recieved correctly
for (i = 0; i < (PARTITIONS * COUNT); i++)
{
assert(message[i] == (i+1));
}
printf("Test Passed Succesfully\n");
MPI_Request_free(&request);
}
MPI_Finalize();
return 0;
}

110 changes: 110 additions & 0 deletions part-comm/test_commOrder3.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,110 @@
/*Partitions MPI Unit Test
*
* Shows the behavior of the communication when a partitioned recv / send corridor is declared.
* Parrived loops trying to find a recieved partition before any are sent and fails.
* Parrived should timeout.
*/

#include <stdio.h>
#include <stdlib.h>
#include "mpi.h"
#include "assert.h"
#include "time.h"

#define PARTITIONS 8
#define COUNT 5
#define TIMEOUT 10000

int main (int argc, char *argv[])
{
//Buffer message
double message [PARTITIONS * COUNT];

//MPI variables declarations
int src = 0, dest = 1, tag = 100, flag = 0, flag2 = 0;
int myrank, provided, timer, trigger, i, j;
MPI_Count partitions = PARTITIONS;
MPI_Request request;

//Initializing threaded MPI
MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED, &provided);
if (provided < MPI_THREAD_SERIALIZED)
MPI_Abort(MPI_COMM_WORLD, EXIT_FAILURE);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);

if (myrank == 0)
{
MPI_Psend_init(message, partitions, COUNT, MPI_DOUBLE, dest, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);

//This Barrier prevents task 0 to initialize a send operation before task 0 loops through Parrived

MPI_Barrier(MPI_COMM_WORLD);

MPI_Start(&request);

//Iterating through each buffer partition, filling them and marking them ready to send
for (i = 0; i < partitions; i++)
{
for (j = (i*COUNT); j < ((i+1)*COUNT); j++)
{
message[j] = j+1;
}
MPI_Pready(i, request);
}

//Test for overall send operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}
MPI_Request_free(&request);
}
else if (myrank == 1)
{
MPI_Precv_init(message, partitions, COUNT, MPI_DOUBLE, src, tag, MPI_COMM_WORLD, MPI_INFO_NULL, &request);
MPI_Start(&request);

//sets a timer in milliseconds equal to the time passed since beginning of operation
timer = clock() * 1000 / CLOCKS_PER_SEC;
//creates a trigger by adding a timeout time in millisecond to the current time passed
trigger = timer + TIMEOUT;

//Iterates through the partitions and check indefinetly to see if they have arrived
for (i = 0; i < partitions; i++)
{
MPI_Parrived(request, i, &flag2);
if (!flag2) {
i--;
}
else {
//Test the buffer to check that the message was recieved correctly
for (j = (i * COUNT); j < ((i+1) * COUNT); j++)
{
assert(message[j] == (j + 1));
}
}
//set timer equal to the current time elapsed
timer = clock() * 1000 / CLOCKS_PER_SEC;
//Abort MPI if Parrived loops more than time time allowed
if (timer > trigger){
printf("Parrived Timeout, No Partitions recieved in %d millisecond", TIMEOUT);
MPI_Abort(MPI_COMM_WORLD, EXIT_FAILURE);
}
}

//This barrier allows task 0 to proceed
MPI_Barrier(MPI_COMM_WORLD);

//Test for overall recieve operation completion
while (!flag)
{
MPI_Test(&request, &flag, MPI_STATUS_IGNORE);
}

printf("Test Passed Succesfully\n");
MPI_Request_free(&request);
}
MPI_Finalize();
return 0;
}

Loading

0 comments on commit 80bc444

Please sign in to comment.