git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2146 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras
parent
9e196968b3
commit
341933d7c0
1 changed files with 101 additions and 101 deletions
|
|
@ -1,31 +1,31 @@
|
|||
/*
|
||||
<moKswapNeighborhood.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
<moKswapNeighborhood.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Boufaras Karima, Thé Van Luong
|
||||
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".
|
||||
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.
|
||||
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
|
||||
*/
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
|
||||
#ifndef _moCudaKswapNeighborhood_h
|
||||
#define _moCudaKswapNeighborhood_h
|
||||
|
|
@ -39,80 +39,80 @@
|
|||
template<class N>
|
||||
class moCudaKswapNeighborhood: public moKswapNeighborhood<N> {
|
||||
|
||||
public:
|
||||
public:
|
||||
|
||||
/**
|
||||
* Define a Neighbor and type of a solution corresponding
|
||||
*/
|
||||
/**
|
||||
* Define a Neighbor and type of a solution corresponding
|
||||
*/
|
||||
|
||||
typedef N Neighbor;
|
||||
typedef typename Neighbor::EOT EOT;
|
||||
typedef N 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;
|
||||
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 size of solution
|
||||
* @param _Kswap the number of swap
|
||||
* @param _eval show how to evaluate neighborhood of a solution at one time
|
||||
*/
|
||||
/**
|
||||
* Constructor
|
||||
* @param _size the size of solution
|
||||
* @param _Kswap the number of swap
|
||||
* @param _eval show how to evaluate neighborhood of a solution at one time
|
||||
*/
|
||||
|
||||
moCudaKswapNeighborhood(unsigned int _size, unsigned int _Kswap,
|
||||
moCudaEval<Neighbor>& _eval) :
|
||||
moKswapNeighborhood<Neighbor> (_size, _Kswap), eval(_eval) {
|
||||
sendMapping = true;
|
||||
cudaMalloc((void**) &device_Mapping, sizeof(unsigned int)
|
||||
* neighborhoodSize * (Kswap + 1));
|
||||
}
|
||||
;
|
||||
moCudaKswapNeighborhood(unsigned int _size, unsigned int _Kswap,
|
||||
moCudaEval<Neighbor>& _eval) :
|
||||
moKswapNeighborhood<Neighbor> (_size, _Kswap), eval(_eval) {
|
||||
sendMapping = true;
|
||||
cudaMalloc((void**) &device_Mapping, sizeof(unsigned int)
|
||||
* neighborhoodSize * (Kswap + 1));
|
||||
}
|
||||
;
|
||||
|
||||
/**
|
||||
*Destructor
|
||||
*/
|
||||
/**
|
||||
*Destructor
|
||||
*/
|
||||
|
||||
~moCudaKswapNeighborhood() {
|
||||
~moCudaKswapNeighborhood() {
|
||||
|
||||
cudaFree(device_Mapping);
|
||||
}
|
||||
cudaFree(device_Mapping);
|
||||
}
|
||||
|
||||
/**
|
||||
* Initialization of the neighborhood
|
||||
* @param _solution the solution to explore
|
||||
* @param _current the first neighbor
|
||||
*/
|
||||
/**
|
||||
* Initialization of the neighborhood
|
||||
* @param _solution the solution to explore
|
||||
* @param _current the first neighbor
|
||||
*/
|
||||
|
||||
virtual void init(EOT& _solution, Neighbor& _current) {
|
||||
virtual void init(EOT& _solution, Neighbor& _current) {
|
||||
|
||||
moKswapNeighborhood<Neighbor>::init(_solution, _current);
|
||||
//Send Mapping for only the first time
|
||||
if (sendMapping) {
|
||||
cudaMemcpy(device_Mapping, mapping, (Kswap + 1) * neighborhoodSize
|
||||
* sizeof(unsigned int), cudaMemcpyHostToDevice);
|
||||
sendMapping = false;
|
||||
}
|
||||
//Compute all neighbors fitness at one time
|
||||
eval.neighborhoodKswapEval(_solution, device_Mapping, Kswap);
|
||||
}
|
||||
moKswapNeighborhood<Neighbor>::init(_solution, _current);
|
||||
//Send Mapping for only the first time
|
||||
if (sendMapping) {
|
||||
cudaMemcpy(device_Mapping, mapping, (Kswap + 1) * neighborhoodSize
|
||||
* sizeof(unsigned int), cudaMemcpyHostToDevice);
|
||||
sendMapping = false;
|
||||
}
|
||||
//Compute all neighbors fitness at one time
|
||||
eval.neighborhoodKswapEval(_solution, device_Mapping, Kswap);
|
||||
}
|
||||
|
||||
/**
|
||||
* Return the class Name
|
||||
* @return the class name as a std::string
|
||||
*/
|
||||
virtual std::string className() const {
|
||||
return "moCudaKSwapNeighborhood";
|
||||
}
|
||||
/**
|
||||
* Return the class Name
|
||||
* @return the class name as a std::string
|
||||
*/
|
||||
virtual std::string className() const {
|
||||
return "moCudaKSwapNeighborhood";
|
||||
}
|
||||
|
||||
protected:
|
||||
protected:
|
||||
|
||||
moCudaEval<Neighbor>& eval;
|
||||
bool sendMapping;
|
||||
unsigned int * device_Mapping;
|
||||
moCudaEval<Neighbor>& eval;
|
||||
bool sendMapping;
|
||||
unsigned int * device_Mapping;
|
||||
|
||||
};
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue