82 lines
2.6 KiB
C++
82 lines
2.6 KiB
C++
#include "CostMatrixGenerator.h"
|
|
#include "MakePermutationMatrix.h"
|
|
#include "ParseMatrixForMPI.h"
|
|
#include "ReadFromFile.h"
|
|
#include "mpi.h"
|
|
#include "SerializeCities.h"
|
|
|
|
#define MCW MPI_COMM_WORLD
|
|
int main(int argc, char* argv[])
|
|
{
|
|
int rank, size, citiesSize;
|
|
int data;
|
|
MPI_Init(&argc, &argv);
|
|
MPI_Comm_rank(MCW, &rank);
|
|
MPI_Comm_size(MCW, &size);
|
|
std::vector<std::vector<double>> costMatrix;
|
|
std::vector<City> cities;
|
|
std::vector<double> flatMatrix;
|
|
std::vector<int> serializedCity;
|
|
if (rank == 0) {
|
|
std::cout << "Reading in file" << std::endl;
|
|
cities = ReadFromFile::ReadFile("../input");
|
|
citiesSize = cities.size();
|
|
//Make costMatrix
|
|
costMatrix = CostMatrixGenerator::GenerateCostMatrix(cities);
|
|
|
|
flatMatrix = matrixTools::FlattenMatrix(costMatrix);
|
|
SerializeCities::Serialize(cities);
|
|
}
|
|
|
|
MPI_Bcast(&citiesSize, 1, MPI_INT, 0, MPI_COMM_WORLD);
|
|
|
|
if(rank){
|
|
// reserve memory for vectors
|
|
flatMatrix.resize(citiesSize*citiesSize);
|
|
cities.resize(citiesSize);
|
|
serializedCity.resize(citiesSize*3);
|
|
costMatrix.resize(citiesSize);
|
|
for(int i = 0; i < citiesSize; i++) {
|
|
costMatrix[i].resize(citiesSize);
|
|
}
|
|
std::cout << "Before B_cast: ";
|
|
for(int i = 0; i < cities.size(); i++){
|
|
std::cout << cities[i].GetName() << " ";
|
|
}
|
|
std::cout << std::endl;
|
|
std::cout << "HERE RANK 1" << std::endl;
|
|
}
|
|
|
|
std::cout << "Rank: " << rank << " IM HERE 1" << std::endl;
|
|
MPI_Bcast(&flatMatrix[0], flatMatrix.size(), MPI_DOUBLE, 0, MPI_COMM_WORLD);
|
|
std::cout << "Rank: " << rank << " IM HERE 2" << std::endl;
|
|
MPI_Bcast(&serializedCity[0], serializedCity.size(), MPI_INT, 0, MPI_COMM_WORLD);
|
|
std::cout << "Rank: " << rank << " IM HERE 3" << std::endl;
|
|
|
|
std::vector<double> costs;
|
|
if(rank){
|
|
std::cout << "IM HERE" << std::endl;
|
|
|
|
cities = SerializeCities::Deserialize(serializedCity);
|
|
|
|
std::cout << "After B_cast: ";
|
|
for(int i = 0; i < cities.size(); i++){
|
|
std::cout << cities[i].GetName() << " ";
|
|
}
|
|
std::cout << std::endl;
|
|
|
|
costMatrix = matrixTools::UnflattenMatrix(flatMatrix, citiesSize, citiesSize);
|
|
//Make permutations
|
|
std::cout << "source size from main " << cities.size() << std::endl;
|
|
costs = MakePermutationMatrix::GetLowestCost(cities, rank, size, costMatrix);
|
|
|
|
}
|
|
// if(!rank){
|
|
// std::cout << costs.size() << std::endl;
|
|
// std::cout << costs[0];
|
|
// }
|
|
|
|
MPI_Finalize();
|
|
|
|
return 0;
|
|
} |