nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Include in new paradiseo-gpu package

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2668 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras 2012-01-24 01:31:56 +00:00
commit a2f5bba3cd
3 changed files with 384 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

100
branches/ParadisEO-GPU/paradiseo-gpu/src/neighborhood/moGPUXBitFlippingN.h Executable file
View file

@ -0,0 +1,100 @@
/*
<moGPUXBitFlippingN.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2012
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 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 _moGPUXBitFlippingN_h
#define _moGPUXBitFlippingN_h
#include <neighborhood/moBackableNeighbor.h>
#include <neighborhood/moXChangeNeighbor.h>
/**
* X-BitFlipping Neighbor
* Neighbor represent different hamming distances,it's fixed by xFlip attribute
*/
template<class EOT, class Fitness = typename EOT::Fitness>
class moGPUXBitFlippingN:public moBackableNeighbor<EOT> ,
public moXChangeNeighbor<EOT> {
public:
using moXChangeNeighbor<EOT>::indices;
using moXChangeNeighbor<EOT>::xChange;
using moXChangeNeighbor<EOT>::key;
/**
*Default Constructor
*/
moGPUXBitFlippingN() :
moXChangeNeighbor<EOT> () {
}
/**
* Constructor
* @param _xFlip the number of bit to flip
*/
moGPUXBitFlippingN(unsigned int _xFlip) :
moXChangeNeighbor<EOT> (_xFlip) {
}
/**
* Apply the K-Flip in solution
* @param _solution the solution to move
*/
virtual void move(EOT& _solution) {
for (unsigned int i = 0; i < xChange; i++)
_solution[indices[i]] = !_solution[indices[i]];
_solution.invalidate();
}
/**
* apply the K-Flip to restore the solution (use by moFullEvalByModif)
* @param _solution the solution to move back
*/
virtual void moveBack(EOT& _solution) {
move(_solution);
}
/**
* Return the class name.
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moGPUXBitFlippingN";
}
};
#endif

177
branches/ParadisEO-GPU/paradiseo-gpu/src/neighborhood/moGPUXChange.h Executable file
View file

@ -0,0 +1,177 @@
/*
<moGPUXChange.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2012
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 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 _moGPUXChange_h
#define _moGPUXChange_h
#include <neighborhood/moGPUMapping.h>
/**
* Generalization of exchange and hamming distance based Neighborhood
*/
template<class N>
class moGPUXChange: public moGPUMapping<N> {
public:
/**
* Define type of a solution corresponding to Neighbor
*/
typedef N Neighbor;
typedef typename Neighbor::EOT EOT;
using moGPUMapping<Neighbor>::neighborhoodSize;
using moGPUMapping<Neighbor>::currentIndex;
using moGPUMapping<Neighbor>::indices;
using moGPUMapping<Neighbor>::mapping;
using moGPUMapping<Neighbor>::xChange;
using moGPUMapping<Neighbor>::mutex;
/**
* Constructor
* @param _neighborhoodSize the neighborhood size
* @param _xChange the number of x-change positions
*/
moGPUXChange(unsigned int _neighborhoodSize, unsigned int _xChange) :
moGPUMapping<Neighbor> (_neighborhoodSize, _xChange) {
}
/**
* Set the mapping of K-indexes
* @param _size the solution size
*/
void setMapping(unsigned _size) {
for (unsigned int i = 0; i < xChange; i++)
indices[i] = i;
unsigned int id = 0;
bool change = false;
while (id < neighborhoodSize) {
while (indices[xChange - 1] < _size) {
updateMapping(indices, id);
indices[(xChange - 1)]++;
id++;
}
indices[xChange - 1]--;
if (id < neighborhoodSize) {
for (int i = xChange - 2; i >= 0; i--)
if (!change)
change = nextIndices(i, _size);
}
change = false;
}
}
/**
* Compute the next combination of mapping indices
* @param _indice compute next combination of indexes from this index
* @param _size the solution size
*/
bool nextIndices(int _indice, unsigned _size) {
if (indices[_indice + 1] == _size - xChange + 1 + _indice) {
if (indices[_indice] + 1 < _size - xChange + 1 + _indice) {
indices[_indice]++;
unsigned int i = 1;
while (_indice + i < xChange) {
indices[_indice + i] = indices[_indice + i - 1] + 1;
i++;
}
return true;
} else {
return false;
}
} else {
indices[_indice + 1]++;
unsigned int i = 2;
while (_indice + i < xChange) {
indices[_indice + i] = indices[_indice + i - 1] + 1;
i++;
}
return true;
}
}
/**
* Setter to fix the number of x-change positions
* @param _xChange the number of x-change
*/
void setXChange(unsigned int _xChange) {
xChange = _xChange;
}
/**
* Get the number of x-change
*/
unsigned int getXChange() {
return xChange;
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moGPUXChange";
}
};
#endif

107
branches/ParadisEO-GPU/paradiseo-gpu/src/neighborhood/moGPUXSwapN.h Executable file
View file

@ -0,0 +1,107 @@
/*
<moGPUXSwapN.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2012
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 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 _moGPUXSwapN_h
#define _moGPUXSwapN_h
#include <neighborhood/moBackableNeighbor.h>
#include <neighborhood/moGPUXChangeNeighbor.h>
/**
* A X-Swap Neighbor
*/
template<class EOT, class Fitness = typename EOT::Fitness>
class moGPUXSwapN: public moBackableNeighbor<EOT> ,
public moGPUXChangeNeighbor<EOT> {
public:
using moGPUXChangeNeighbor<EOT>::indices;
using moGPUXChangeNeighbor<EOT>::xChange;
using moGPUXChangeNeighbor<EOT>::key;
/**
*Default Constructor
*/
moGPUXSwapN() :
moGPUXChangeNeighbor<EOT> () {
}
/**
* Constructor
* @param _xSwap the number of swap to do
*/
moGPUXSwapN(unsigned int _xSwap) :
moGPUXChangeNeighbor<EOT> (_xSwap) {
}
/**
* Apply the K-swap
* @param _solution the solution to move
*/
virtual void move(EOT& _solution) {
EOT tmp(1);
for (unsigned int i = 0; i < xChange-1; i++) {
tmp[0] = _solution[indices[i]];
_solution[indices[i]] = _solution[indices[i + 1]];
_solution[indices[i + 1]] = tmp[0];
}
_solution.invalidate();
}
/**
* apply the K-swap to restore the solution (use by moFullEvalByModif)
* @param _solution the solution to move back
*/
virtual void moveBack(EOT& _solution) {
EOT tmp(1);
for (int i = xChange-1; i > 0; i--) {
tmp[0] = _solution[indices[i]];
_solution[indices[i]] = _solution[indices[i - 1]];
_solution[indices[i - 1]] = tmp[0];
}
_solution.invalidate();
}
/**
* Return the class name.
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moGPUXSwapN";
}
};
#endif