diff --git a/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleTS_CPU.cu b/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleTS_CPU.cu index 29b02f4cd..e69de29bb 100644 --- a/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleTS_CPU.cu +++ b/ParadisEO-GPU/tutoriel/QAP_CPU/application/testSimpleTS_CPU.cu @@ -1,251 +0,0 @@ -/* - - Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 - - Karima Boufaras, Thé Van LUONG - - This software is governed by the CeCILL license under French law and - abiding by the rules of distribution of free software. You can use, - modify and/ or redistribute the software under the terms of the CeCILL - license as circulated by CEA, CNRS and INRIA at the following URL - "http://www.cecill.info". - - As a counterpart to the access to the source code and rights to copy, - modify and redistribute granted by the license, users are provided only - with a limited warranty and the software's author, the holder of the - economic rights, and the successive licensors have only limited liability. - - In this respect, the user's attention is drawn to the risks associated - with loading, using, modifying and/or developing or reproducing the - software by the user in light of its specific status of free software, - that may mean that it is complicated to manipulate, and that also - therefore means that it is reserved for developers and experienced - professionals having in-depth computer knowledge. Users are therefore - encouraged to load and test the software's suitability as regards their - requirements in conditions enabling the security of their systems and/or - data to be ensured and, more generally, to use and operate it in the - same conditions as regards security. - The fact that you are presently reading this means that you have had - knowledge of the CeCILL license and that you accept its terms. - - ParadisEO WebSite : http://paradiseo.gforge.inria.fr - Contact: paradiseo-help@lists.gforge.inria.fr -*/ - -#include -#include -#include -using namespace std; - -//Specific data problem -unsigned * a; -unsigned * b; -unsigned n; - -// The general include for eo -#include -#include -// Fitness function -#include -// Cuda Fitness function -#include -// QAP solution -#include -#include -//QAP neighbor -#include -//QAP neighborhood -#include -//QAP data -#include -// The Solution and neighbor comparator -#include -#include -// The Iter continuator -#include -// Local search algorithm -#include -//Algorithm and its components -#include -//Tabu list -#include -//Memories -#include -#include -#include -//To compute execution time -#include - -typedef eoInt solution; -typedef moIndexedSwapNeighbor Neighbor; -typedef moOrderNeighborhood Neighborhood; - -int main(int argc, char **argv) -{ - - /* ========================================================= - * - * Parameters - * - * ========================================================= */ - - // First define a parser from the command-line arguments - eoParser parser(argc, argv); - - // 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(); - - // Iteration number - eoValueParam nbIterationParam(1, "nbIteration", "TS Iteration number", 'I'); - parser.processParam( nbIterationParam, "TS Iteration number" ); - unsigned nbIteration = nbIterationParam.value(); - - // size tabu list - eoValueParam sizeTabuListParam(7, "sizeTabuList", "size of the tabu list", 'T'); - parser.processParam( sizeTabuListParam, "Search Parameters" ); - unsigned sizeTabuList = sizeTabuListParam.value(); - - // duration tabu list - eoValueParam durationParam(7, "duration", "duration of the tabu list", 'D'); - parser.processParam( durationParam, "Search Parameters" ); - unsigned duration = durationParam.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); - - /* ========================================================= - * - * Initilisation of QAP data - * - * ========================================================= */ - - load(argv[1]); - - /* ========================================================= - * - * Initilisation of the solution - * - * ========================================================= */ - - eoInitPermutation init(n); - solution sol; - init(sol); - - /*========================================================= - * - * Evaluation of a solution neighbor's - * - * ========================================================= */ - - QapEval eval; - QapIncrEval incr_eval; - - /* ========================================================= - * - * Comparator of solutions and neighbors - * - * ========================================================= */ - - moNeighborComparator comparator; - moSolNeighborComparator solComparator; - - /* ========================================================= - * - * a solution neighborhood - * - * ========================================================= */ - - Neighborhood neighborhood(n*(n-1)/2); - - /* ========================================================= - * - * continuator - * - * ========================================================= */ - - moIterContinuator continuator(nbIteration); - - /*========================================================= - * - * Tabu list - * - * ========================================================= */ - - sizeTabuList=(n*(n-1))/2; - duration=sizeTabuList/8; - // tabu list - moIndexedVectorTabuList tl(sizeTabuList,duration); - - /* ========================================================= - * - * Memories - * - * ========================================================= */ - - moDummyIntensification inten; - moDummyDiversification div; - moBestImprAspiration asp; - - /* ========================================================= - * - * the Tabu search algorithm - * - * ========================================================= */ - - //General Constructor - moTS tabuSearch(neighborhood, eval, incr_eval, comparator, solComparator, continuator, tl, inten, div, asp); - - /* ========================================================= - * - * Execute the Tabu 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<< std::endl; - // Create timer for timing CUDA calculation - moCudaTimer timer; - timer.start(); - tabuSearch(sol); - timer.stop(); - std::cout << "final: " << sol << std::endl; - printf("CUDA execution time = %f ms\n",timer.getTime()); - timer.deleteTimer(); - - delete[] a; - delete[] b; - - -return 0; -}