bradybod-usu/cs5500_parallel_prog
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Auto Commit

Browse Source
This commit is contained in:
bbod
2020-03-31 01:30:30 -06:00
parent 8713f1aa1d
commit 8209da9e01
1 changed files with 12 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
HW10/main.cpp
View File

@@ -2,13 +2,17 @@
#include "MakePermutationMatrix.h" #include "MakePermutationMatrix.h"
#include "ParseMatrixForMPI.h" #include "ParseMatrixForMPI.h"
#include "ReadFromFile.h" #include "ReadFromFile.h"
#include "mpi.h"
#include "SerializeCities.h" #include "SerializeCities.h"
#include "mpi.h"
#include <chrono>
#include <tclDecls.h>
#define MCW MPI_COMM_WORLD #define MCW MPI_COMM_WORLD
int main(int argc, char* argv[]) int main(int argc, char* argv[])
{ {
int rank, size, citiesSize; int rank, size, citiesSize;
std::chrono::time_point<std::chrono::steady_clock> start, stop;
long double lowestCost = 0; long double lowestCost = 0;
MPI_Init(&argc, &argv); MPI_Init(&argc, &argv);
MPI_Comm_rank(MCW, &rank); MPI_Comm_rank(MCW, &rank);
@@ -50,10 +54,15 @@ int main(int argc, char* argv[])
//Make permutations //Make permutations
} }
lowestCost = MakePermutationMatrix::GetLowestCost(cities, rank, size, costMatrix);
if(!rank) if(!rank)
start = std::chrono::high_resolution_clock::now();
lowestCost = MakePermutationMatrix::GetLowestCost(cities, rank, size, costMatrix);
if(!rank){
stop = std::chrono::high_resolution_clock::now();
std::cout << "The lowest cost is " << lowestCost << std::endl; std::cout << "The lowest cost is " << lowestCost << std::endl;
auto duration = std::chrono::duration_cast<std::chrono::seconds>(stop - start);
std::cout << "Found in " << duration.count() << " seconds." << std::endl;
}
MPI_Finalize(); MPI_Finalize();