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

add for new customized type

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2267 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras 2011-05-25 21:50:10 +00:00
commit ab91178343
3 changed files with 351 additions and 82 deletions
Download patch file Download diff file Expand all files Collapse all files

170
branches/ParadisEO-GPU/src/problems/types/PPPSolution.h
View file

@ -1,107 +1,129 @@
/* /*
<PPPSolution.h> <PPPSolution.h>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
Karima Boufaras, Thé Van LUONG Karima Boufaras, Thé Van LUONG
This software is governed by the CeCILL license under French law and This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use, abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info". "http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy, 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 modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited liability. economic rights, and the successive licensors have only limited liability.
In this respect, the user's attention is drawn to the risks associated In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software, 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 that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or 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 data to be ensured and, more generally, to use and operate it in the
same conditions as regards security. same conditions as regards security.
The fact that you are presently reading this means that you have had The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms. knowledge of the CeCILL license and that you accept its terms.
ParadisEO WebSite : http://paradiseo.gforge.inria.fr ParadisEO WebSite : http://paradiseo.gforge.inria.fr
Contact: paradiseo-help@lists.gforge.inria.fr Contact: paradiseo-help@lists.gforge.inria.fr
*/ */
#ifndef _PPPSolution_H_ #ifndef __PPPSolution_H_
#define _PPPSolution_H_ #define __PPPSolution_H_
#include <cudaType/moCudaVector.h> #include <GPUType/moGPUVector.h>
/** /**
* Implementation of PPP vector representation on CUDA. * Implementation of PPP vector representation on GPU.
*/ */
template<class Fitness> template<class Fitness>
class PPPSolution: public moCudaVector<int, Fitness> { class PPPSolution: public moGPUVector<int, Fitness> {
public: public:
using moCudaVector<int, Fitness>::vect; using moGPUVector<int, Fitness>::vect;
using moCudaVector<int, Fitness>::N; using moGPUVector<int, Fitness>::N;
/** /**
* Default constructor. * Default constructor.
*/ */
PPPSolution() : PPPSolution() :
moCudaVector<int, Fitness> () { moGPUVector<int, Fitness> () {
} }
/** /**
*Constructor. *Constructor.
*@param _size The neighborhood size. *@param _size The neighborhood size.
*/ */
PPPSolution(unsigned _size) { PPPSolution(unsigned _size) {
N = _size; N = _size;
vect = new int[_size]; vect = new int[_size];
create(); create();
} }
/** /**
*Assignment operator *Assignment operator
*@param _vector The vector passed to the function determine the new content. *@param _vector The vector passed to the function determine the new content.
*@return a new vector. *@return a new vector.
*/ */
PPPSolution& operator=(const PPPSolution & _vector) { PPPSolution& operator=(const PPPSolution & _vector) {
N = _vector.N; N = _vector.N;
vect = new int[N]; vect = new int[N];
for (unsigned i = 0; i < N; i++) for (unsigned i = 0; i < N; i++)
vect[i] = _vector.vect[i]; vect[i] = _vector.vect[i];
fitness(_vector.fitness()); fitness(_vector.fitness());
return (*this); return (*this);
} }
/** /**
*Initializer of random PPP vector. *Initializer of random PPP vector.
*/ */
void create() { void create() {
for (int i = 0; i <N; i++){ for (int i = 0; i < N; i++) {
if((rng.rand()%2)==0) if ((rng.rand() % 2) == 0)
vect[i] = -1; vect[i] = -1;
else else
vect[i] = 1; vect[i] = 1;
} }
} }
/**
*Function inline to set the size of vector, called from host and device.
*@param _size the vector size
*/
virtual void setSize(unsigned _size){
N=_size;
}
/**
* Print the solution
*/
virtual void printOn(std::ostream& os) const {
EO<Fitness>::printOn(os);
os << ' ';
os << N << ' ';
unsigned int i;
for (i = 0; i < N; i++)
os << vect[i] << ' ';
}
}; };

115
branches/ParadisEO-GPU/src/problems/types/moGPUCustomizeType.h Normal file
View file

@ -0,0 +1,115 @@
/*
<moGPUCustomizeType.h>
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
*/
#ifndef _moGPUCustomizeType_H_
#define _moGPUCustomizeType_H_
/**
* Implementation of an Example of customized type
*/
template<class T1, class T2>
typedef struct sol2Type {
T1 tab1[SIZE];
T2 tab2[SIZE];
inline __host__ __device__ sol2Type& operator=(const sol2Type _vector) {
for (unsigned i = 0; i < SIZE; i++) {
tab1[i] = _vector.tab1[i];
tab2[i] = _vector.tab2[i];
}
return (*this);
}
inline __host__ __device__ unsigned size() {
return SIZE;
}
}Type2;
template<class T1, class T2,class T3>
typedef struct sol3Type {
T1 tab1[SIZE];
T2 tab2[SIZE];
T3 tab3[SIZE];
inline __host__ __device__ sol3Type& operator=(const sol3Type _vector) {
for (unsigned i = 0; i < SIZE; i++) {
tab1[i] = _vector.tab1[i];
tab2[i] = _vector.tab2[i];
tab3[i] = _vector.tab3[i];
}
return (*this);
}
inline __host__ __device__ unsigned size() {
return SIZE;
}
}Type3;
template<class T1, class T2,class T3,class T4>
typedef struct sol4Type {
T1 tab1[SIZE];
T2 tab2[SIZE];
T3 tab3[SIZE];
T4 tab4[SIZE];
inline __host__ __device__ sol4Type& operator=(const sol4Type _vector) {
for (unsigned i = 0; i < SIZE; i++) {
tab1[i] = _vector.tab1[i];
tab2[i] = _vector.tab2[i];
tab3[i] = _vector.tab3[i];
tab4[i] = _vector.tab4[i];
}
return (*this);
}
inline __host__ __device__ unsigned size() {
return SIZE;
}
}Type4;
#endif

132
branches/ParadisEO-GPU/src/problems/types/moGPUCustomizeVector.h Normal file
View file

@ -0,0 +1,132 @@
/*
<moGPUCustomizeVector.h>
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
*/
#ifndef _moGPUCustomizeVector_H_
#define _moGPUCustomizeVector_H_
#include <GPUType/moGPUVector.h>
/**
* An Example of a customized vector representation on GPU.
*/
template<class ElemT, class Fitness>
class moGPUCustomizeVector: public moGPUVector<ElemT, Fitness> {
public:
/**
* Define vector type of vector corresponding to Solution
*/
typedef ElemT ElemType;
using moGPUVector<ElemType, Fitness>::vect;
using moGPUVector<ElemType, Fitness>::N;
/**
* Default constructor.
*/
moGPUCustomizeVector() :
moGPUVector<ElemType, Fitness> () {
}
/**
*Constructor.
*@param _size The size of the vector to create.
*/
moGPUCustomizeVector(unsigned _size) :
moGPUVector<ElemType, Fitness> (_size) {
create();
}
/**
*Assignment operator
*@param _vector The vector passed to the function determine the new content.
*@return a new vector.
*/
moGPUCustomizeVector<ElemT, Fitness> & operator=(const moGPUCustomizeVector<ElemT, Fitness> & _vector) {
vect[0] = _vector[0];
if (!(_vector.invalid()))
fitness(_vector.fitness());
else
(*this).invalidate();
return (*this);
}
/**
*How to fill the vector.
*/
virtual void create() {
for (int i = 0; i < vect[0].size(); i++) {
vect[0].tab1[i] = (int) (rng.rand() % (vect[0].size() - i) + i);
vect[0].tab2[i] = (float) (rng.rand() % (vect[0].size() - i) + i);
}
}
/**
* Print the solution
*/
virtual void printOn(std::ostream& os) const {
EO<Fitness>::printOn(os);
os << ' ';
os << vect[0].size() << ' ';
unsigned int i;
for (i = 0; i < vect[0].size(); i++) {
os << vect[0].tab1[i] << ' ';
}
os << endl << " ";
for (i = 0; i < vect[0].size(); i++) {
os << vect[0].tab2[i] << ' ';
}
}
inline __host__ __device__ unsigned size() {
return N;
}
};
#endif