git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2362 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
ef15b782f7
commit
a05ae42c0b
2 changed files with 28 additions and 147 deletions
|
|
@ -1,122 +0,0 @@
|
||||||
/*
|
|
||||||
<moKswapNeighborhood.h>
|
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
|
||||||
|
|
||||||
Boufaras Karima, 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 ue,
|
|
||||||
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".
|
|
||||||
|
|
||||||
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
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef _moCudaKswapNeighborhood_h
|
|
||||||
#define _moCudaKswapNeighborhood_h
|
|
||||||
|
|
||||||
#include <neighborhood/moKswapNeighborhood.h>
|
|
||||||
#include <eval/moCudaEval.h>
|
|
||||||
|
|
||||||
/**
|
|
||||||
* K-flip Neighborhood
|
|
||||||
*/
|
|
||||||
template<class Neighbor>
|
|
||||||
class moCudaTypeNeighborhood: public moKswapNeighborhood<Neighbor> {
|
|
||||||
|
|
||||||
public:
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Define a type of a solution corresponding to Neighbor
|
|
||||||
*/
|
|
||||||
|
|
||||||
typedef typename Neighbor::EOT EOT;
|
|
||||||
|
|
||||||
using moKswapNeighborhood<Neighbor>::neighborhoodSize;
|
|
||||||
using moKswapNeighborhood<Neighbor>::currentIndex;
|
|
||||||
using moKswapNeighborhood<Neighbor>::indices;
|
|
||||||
using moKswapNeighborhood<Neighbor>::mapping;
|
|
||||||
using moKswapNeighborhood<Neighbor>::Kswap;
|
|
||||||
using moKswapNeighborhood<Neighbor>::size;
|
|
||||||
using moKswapNeighborhood<Neighbor>::mutex;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Constructor
|
|
||||||
* @param _size the solution size
|
|
||||||
* @param _Kpos the number of element to change in solution
|
|
||||||
* @param _eval show how to evaluate neighborhood of a solution at one time
|
|
||||||
*/
|
|
||||||
|
|
||||||
moCudaTypeNeighborhood(unsigned int _size,unsigned int Kpos,moCudaEval<Neighbor>& _eval) :
|
|
||||||
moKswapNeighborhood<Neighbor> (_size, Kpos), eval(_eval) {
|
|
||||||
sendMapping = true;
|
|
||||||
cudaMalloc((void**) &device_Mapping, sizeof(unsigned int)
|
|
||||||
* neighborhoodSize * (Kswap + 1));
|
|
||||||
}
|
|
||||||
;
|
|
||||||
|
|
||||||
/**
|
|
||||||
*Destructor
|
|
||||||
*/
|
|
||||||
|
|
||||||
~moCudaTypeNeighborhood() {
|
|
||||||
|
|
||||||
cudaFree(device_Mapping);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Initialization of the neighborhood
|
|
||||||
* @param _solution the solution to explore
|
|
||||||
* @param _current the first neighbor
|
|
||||||
*/
|
|
||||||
|
|
||||||
virtual void init(EOT& _solution, Neighbor& _current) {
|
|
||||||
|
|
||||||
moKswapNeighborhood<Neighbor>::init(_solution, _current);
|
|
||||||
if (sendMapping) {
|
|
||||||
cudaMemcpy(device_Mapping, mapping, (Kswap + 1) * neighborhoodSize
|
|
||||||
* sizeof(unsigned int), cudaMemcpyHostToDevice);
|
|
||||||
sendMapping = false;
|
|
||||||
}
|
|
||||||
int fitness=_solution.fitness();
|
|
||||||
//Compute all neighbors fitness at one time
|
|
||||||
eval.neighborhoodEval1(_solution, device_Mapping);
|
|
||||||
}
|
|
||||||
|
|
||||||
virtual void next(EOT& _solution, Neighbor& _current) {
|
|
||||||
|
|
||||||
moKswapNeighborhood<Neighbor>::next(_solution, _current);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Return the class Name
|
|
||||||
* @return the class name as a std::string
|
|
||||||
*/
|
|
||||||
virtual std::string className() const {
|
|
||||||
return "moCudaTypeNeighborhood";
|
|
||||||
}
|
|
||||||
|
|
||||||
protected:
|
|
||||||
|
|
||||||
moCudaEval<Neighbor>& eval;
|
|
||||||
bool sendMapping;
|
|
||||||
unsigned int * device_Mapping;
|
|
||||||
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif
|
|
||||||
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
<moCudaBitNeighbor.h>
|
<moGPUCustomizedNeighbor.h>
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||||
|
|
||||||
Jerémie Humeau, Boufaras Karima, Thé Van LUONG
|
Jerémie Humeau, Boufaras Karima, Thé Van LUONG
|
||||||
|
|
@ -32,40 +32,41 @@
|
||||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
*/
|
*/
|
||||||
|
|
||||||
#ifndef _moCudaTypeNeighbor_h
|
#ifndef _moGPUCustomizedNeighbor_h
|
||||||
#define _moCudaTypeNeighbor_h
|
#define _moGPUCustomizedNeighbor_h
|
||||||
|
|
||||||
#include <neighborhood/moBackableNeighbor.h>
|
#include <neighborhood/moBackableNeighbor.h>
|
||||||
#include <neighborhood/moIndexSwapNeighbor.h>
|
#include <neighborhood/moXChangeNeighbor.h>
|
||||||
|
#include <problems/types/moGPUSolType2Vector.h>
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Neighbor related to a solution vector of EOT (type)
|
* Neighbor related to a solution vector composed by two vectors
|
||||||
*/
|
*/
|
||||||
|
|
||||||
template<class EOT, class Fitness = typename EOT::Fitness>
|
template<class Fitness>
|
||||||
class moCudaTypeNeighbor: public moBackableNeighbor<EOT> ,
|
class moGPUCustomizedNeighbor: public moBackableNeighbor< moGPUSolType2Vector<Fitness> > ,
|
||||||
public moIndexSwapNeighbor<EOT> {
|
public moXChangeNeighbor< moGPUSolType2Vector<Fitness> > {
|
||||||
|
|
||||||
public:
|
public:
|
||||||
|
|
||||||
using moIndexSwapNeighbor<EOT>::indices;
|
using moXChangeNeighbor< moGPUSolType2Vector<Fitness> >::indices;
|
||||||
using moIndexSwapNeighbor<EOT>::Kswap;
|
using moXChangeNeighbor< moGPUSolType2Vector<Fitness> >::xChange;
|
||||||
using moIndexSwapNeighbor<EOT>::size;
|
using moXChangeNeighbor< moGPUSolType2Vector<Fitness> >::key;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
*Default Constructor
|
*Default Constructor
|
||||||
*/
|
*/
|
||||||
|
|
||||||
moCudaTypeNeighbor() :
|
moGPUCustomizedNeighbor() :
|
||||||
moIndexSwapNeighbor<EOT> () {
|
moXChangeNeighbor< moGPUSolType2Vector<Fitness> > () {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Constructor
|
* Constructor
|
||||||
* @param _Kpos the number of bit to flip
|
* @param _xSwap the number of bit to swap
|
||||||
*/
|
*/
|
||||||
|
|
||||||
moCudaTypeNeighbor(unsigned int _Kpos) :
|
moGPUCustomizedNeighbor(unsigned int _xSwap) :
|
||||||
moIndexSwapNeighbor<EOT> (_Kpos) {
|
moXChangeNeighbor< moGPUSolType2Vector<Fitness> > (_xSwap) {
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
|
@ -73,20 +74,22 @@ public:
|
||||||
* @param _solution the solution to move
|
* @param _solution the solution to move
|
||||||
*/
|
*/
|
||||||
|
|
||||||
virtual void move(EOT & _solution) {
|
virtual void move(moGPUSolType2Vector<Fitness> & _solution) {
|
||||||
int tmp;
|
std::cout<<"_solution"<<std::endl;
|
||||||
tmp = _solution[0].tab1[indices[0]];
|
float tmp;
|
||||||
_solution[0].tab1[indices[0]] = _solution[0].tab1[indices[1]];
|
tmp = _solution[0].tab2[indices[0]];
|
||||||
_solution[0].tab1[indices[1]] = tmp;
|
_solution[0].tab2[indices[0]] = _solution[0].tab2[indices[1]];
|
||||||
|
_solution[0].tab2[indices[1]] = tmp;
|
||||||
|
std::cout<<_solution<<std::endl;
|
||||||
_solution.invalidate();
|
_solution.invalidate();
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* apply the poveBack to restore the solution (use by moFullEvalByModif)
|
* apply the moveBack to restore the solution (use by moFullEvalByModif)
|
||||||
* @param _solution the solution to move back
|
* @param _solution the solution to move back
|
||||||
*/
|
*/
|
||||||
|
|
||||||
virtual void moveBack(EOT& _solution) {
|
virtual void moveBack(moGPUSolType2Vector<Fitness> & _solution) {
|
||||||
move(_solution);
|
move(_solution);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
@ -95,7 +98,7 @@ public:
|
||||||
* @return the class name as a std::string
|
* @return the class name as a std::string
|
||||||
*/
|
*/
|
||||||
virtual std::string className() const {
|
virtual std::string className() const {
|
||||||
return "moCudaTypeNeighbor";
|
return "moGPUCustomizedNeighbor";
|
||||||
}
|
}
|
||||||
|
|
||||||
};
|
};
|
||||||
Loading…
Add table
Add a link
Reference in a new issue