//Init the number of threads per block #define BLOCK_SIZE 64 #include #include #include using namespace std; __device__ int * dev_a; __device__ int * dev_b; // The general include for eo #include #include // Fitness function #include // Cuda Fitness function #include #include //Specific data to QAP problem #include // QAP solution #include // One Max neighbor #include //To compute execution time #include // One Max ordered neighborhood #include // The Solution and neighbor comparator #include #include // The continuator #include // Local search algorithm #include // Simple HC algorithm #include // The simple HC algorithm explorer #include #include typedef moCudaIntVector solution; typedef moKswapNeighbor Neighbor; typedef moCudaKswapNeighborhood Neighborhood; int main(int argc, char **argv) { /* ========================================================= * * Parameters * * ========================================================= */ // First define a parser from the command-line arguments eoParser parser(argc, argv); if (argc < 2){ printf("Saisissez le nom de fichier dat à manipuler \n"); exit(1); } // For each parameter, define Parameter, read it through the parser, // and assign the value to the variable // seed eoValueParam seedParam(time(0), "seed", "Random number seed", 'S'); parser.processParam( seedParam ); unsigned seed = seedParam.value(); // description of genotype eoValueParam vecSizeParam(6, "vecSize", "Genotype size", 'V'); parser.processParam( vecSizeParam, "Representation" ); unsigned vecSize = vecSizeParam.value(); // Swap number eoValueParam KSwapParam(0, "KSwap", "swap number", 'N'); parser.processParam(KSwapParam, "KSwap" ); unsigned KSwap = KSwapParam.value(); // the name of the "status" file where all actual parameter values will be saved string str_status = parser.ProgramName() + ".status"; // default value eoValueParam statusParam(str_status.c_str(), "status", "Status file"); parser.processParam( statusParam, "Persistence" ); // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED // i.e. in case you need parameters somewhere else, postpone these if (parser.userNeedsHelp()) { parser.printHelp(cout); exit(1); } if (statusParam.value() != "") { ofstream os(statusParam.value().c_str()); os << parser;// and you can use that file as parameter file } /* ========================================================= * * Random seed * * ========================================================= */ //reproducible random seed: if you don't change SEED above, // you'll aways get the same result, NOT a random run rng.reseed(seed); srand(time(NULL)); /* ========================================================= * * Initilisation of QAP data * * ========================================================= */ QAPData _data(argv[1]); vecSize=_data.sizeData; /* ========================================================= * * Initilisation of the solution * * ========================================================= */ solution sol(vecSize); /*for (int i=0;i eval(_data); unsigned long int sizeMap=sizeMapping(vecSize,KSwap); std::cout<<"sizeMap : "< incr_eval; moCudaKswapEval > cueval(sizeMap,incr_eval); /* ========================================================= * * Comparator of solutions and neighbors * * ========================================================= */ moNeighborComparator comparator; moSolNeighborComparator solComparator; /* ========================================================= * * a solution neighborhood * * ========================================================= */ Neighborhood neighborhood(vecSize,KSwap,cueval); /* ========================================================= * * An explorer of solution neighborhood's * * ========================================================= */ moSimpleHCexplorer explorer(neighborhood, cueval, comparator, solComparator); /* ========================================================= * * The local search algorithm * * ========================================================= */ //True continuator <=> Always continue moTrueContinuator continuator; moLocalSearch localSearch(explorer,continuator, eval); /* ========================================================= * * The simple Hill Climbing algorithm * * ========================================================= */ moSimpleHC simpleHC(neighborhood,eval,cueval); /* ========================================================= * * Execute the local search from random sollution * * ========================================================= */ //Can be eval here, else it will be done at the beginning of the localSearch eval(sol); std::cout << "initial: " << sol.fitness()<< std::endl; // Create timer for timing CUDA calculation moCudaTimer timer; timer.start(); localSearch(sol); std::cout << "final: " << sol.fitness() << std::endl; timer.stop(); printf("CUDA execution time = %f ms\n",timer.getTime()); timer.deleteTimer(); /* simpleHC(sol); std::cout << "final: " << sol.fitness() << std::endl;*/ _data.cudaObject.free(dev_a); _data.cudaObject.free(dev_b); return 0; }