Commit c9ea1a70 authored by Ben Hazelwood's avatar Ben Hazelwood
Browse files

Plot deltas

parent da7fbcf7
......@@ -11,8 +11,8 @@
#include <cstdlib>
#include <math.h>
const int NUM_TRIALS = 1e6 ;
const int NUM_COMPUTATIONS = 1e0;
const int NUM_TRIALS = 100 ;
const int NUM_COMPUTATIONS = 5e7;
int main(int argc, char *argv[])
{
......@@ -51,14 +51,6 @@ int main(int argc, char *argv[])
MPI_Sendrecv(MPI_IN_PLACE, 0, MPI_BYTE, MPI_PROC_NULL, 1, MPI_IN_PLACE, 0, MPI_BYTE, MPI_PROC_NULL, 0, MPI_COMM_SELF, MPI_STATUS_IGNORE);
#endif
MPI_Barrier(MPI_COMM_WORLD);
// if (rank == source)
// {
// MPI_Recv(&m, 1, MPI_CHAR, source, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
// }
// else
// {
// MPI_Send(&m, 1, MPI_CHAR, dest, 0, MPI_COMM_WORLD);
// }
}
MPI_Finalize();
......
......@@ -46,11 +46,11 @@ void Timing::initialiseTiming() {
synchroniseRanksInTeam();
timer.startTime = PMPI_Wtime();
for (int i=0; i < getNumberOfTeams(); i++) {
timer.heartbeatTimes.insert(std::make_pair(i,std::list<double>()));
timer.heartbeatTimeRequests.insert(std::make_pair(i,std::list<MPI_Request>()));
timer.heartbeatTimes.insert(std::make_pair(i, std::list<double>());
timer.heartbeatTimeRequests.insert(std::make_pair(i, std::list<MPI_Request>()));
timer.heartbeatHashes.insert(std::make_pair(i,std::list<std::size_t>()));
timer.heartbeatHashRequests.insert(std::make_pair(i,std::list<MPI_Request>()));
timer.heartbeatHashes.insert(std::make_pair(i, std::list<std::size_t>()));
timer.heartbeatHashRequests.insert(std::make_pair(i, std::list<MPI_Request>()));
}
}
......
#!/bin/bash
if (( $# < 4)); then
echo "ERROR: At least four parameters are required"
if (( $# < 3)); then
echo "ERROR: At least three parameters are required"
echo "Usage: { constant | increasing | random } { single | rr | random } application [application args...]"
exit 1
fi
mpirun -np 4 -l ${@:3} &
mpirun -np 4 ${@:3} &
sleep 2
pids=($(pgrep Latency))
pids=($(pgrep PerfSimulator))
iteration=1
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment