1 // Copyright (C) 2011-2015 CEA/DEN, EDF R&D, OPEN CASCADE
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
25 #define EPSILON 0.00000001
31 int main(int argc, char**argv)
34 double *vector, sum=0., norm=1., etalon=0.;
35 int rank, size, grank, gsize, rsize;
36 int vsize=20, lvsize, rlvsize;
37 int i, k1, k2, imin, imax, nb;
42 char port_name [MPI_MAX_PORT_NAME];
43 char port_name_clt [MPI_MAX_PORT_NAME];
44 std::string service = "SERVICE";
48 std::string sargv = argv[i];
49 if(sargv.find("-debug")!=std::string::npos)
51 else if(sargv.find("-vsize")!=std::string::npos)
52 vsize = atoi(argv[++i]);
55 MPI_Init( &argc, &argv );
57 MPI_Comm_size( MPI_COMM_WORLD, &size );
58 MPI_Comm_rank( MPI_COMM_WORLD, &rank );
60 MPI_Barrier(MPI_COMM_WORLD);
62 MPI_Errhandler_set(MPI_COMM_WORLD, MPI_ERRORS_RETURN);
64 MPI_Info_create(&info);
65 MPI_Info_set(info, "ompi_unique", "true");
67 MPI_Open_port(MPI_INFO_NULL, port_name);
68 if ( MPI_Lookup_name((char*)service.c_str(), MPI_INFO_NULL, port_name_clt) == MPI_SUCCESS ) {
70 std::cout << "[" << rank << "] I am client: I get the service " << service << " !" << std::endl;
71 MPI_Close_port( port_name );
73 else if ( MPI_Publish_name((char*)service.c_str(), info, port_name) == MPI_SUCCESS ) {
75 std::cout << "[" << rank << "] I am server: I've managed to publish the service " << service << " !" << std::endl;
78 else if ( MPI_Lookup_name((char*)service.c_str(), MPI_INFO_NULL, port_name_clt) == MPI_SUCCESS ) {
80 std::cout << "[" << rank << "] I am client: I get the service " << service << " !" << std::endl;;
81 MPI_Close_port( port_name );
85 std::cout << "[" << rank << "] ERROR!!!" << std::endl;
92 while ( i != TIMEOUT ) {
94 if ( MPI_Lookup_name((char*)service.c_str(), MPI_INFO_NULL, port_name_clt) == MPI_SUCCESS ) {
96 std::cout << "[" << rank << "] I am client: I get the service " << service << " !" << std::endl;
101 if ( i == TIMEOUT ) {
103 std::cout << "[" << rank << "] Waiting too long exiting !" << std::endl;
108 MPI_Errhandler_set(MPI_COMM_WORLD, MPI_ERRORS_ARE_FATAL);
109 MPI_Bcast(&srv,1,MPI_INT,0,MPI_COMM_WORLD);
111 MPI_Comm_accept( port_name, MPI_INFO_NULL, 0, MPI_COMM_WORLD, &icom );
113 MPI_Comm_connect(port_name_clt, MPI_INFO_NULL, 0, MPI_COMM_WORLD, &icom );
115 MPI_Intercomm_merge(icom,!srv,&com);
117 MPI_Comm_rank( com, &grank );
118 MPI_Comm_size( com, &gsize );
121 lvsize = ((rank+1)*vsize) / size - (rank*vsize) / size;
122 vector = (double*)malloc(lvsize*sizeof(double));
123 indg = (int*)malloc(lvsize*sizeof(int));
124 rsize = gsize - size;
126 for(i=0;i<lvsize;i++){
127 indg[i] = (rank*vsize)/size + i;
132 vector[i] = 2. * sin( (rank*vsize)/size + i );
133 sum += vector[i]*vector[i];
138 MPI_Reduce(&sum,&norm,1,MPI_DOUBLE,MPI_SUM,0,MPI_COMM_WORLD);
142 std::cout << "[" << grank << "] norm=" << norm << std::endl;
146 for(i=0;i<rsize;i++){
147 rlvsize = ((i+1)*vsize) / rsize - (i*vsize) / rsize;
148 k1 = (i*vsize)/rsize;
149 k2 = ((i+1)*vsize)/rsize -1;
151 if( (k1 <= indg[lvsize-1]) && (k2 >= indg[0]) ){
153 if( indg[0] > imin ) imin = indg[0];
155 if( indg[lvsize-1] < imax) imax = indg[lvsize-1];
157 nb = imax - imin + 1;
158 MPI_Send( &nb, 1, MPI_INT, i+size, 100, com );
159 MPI_Send( vector+imin-indg[0], nb, MPI_DOUBLE, i+size, 200, com );
162 MPI_Recv( &nb, 1, MPI_INT, i, 100, com, &status );
163 MPI_Recv( vector+imin-indg[0], nb, MPI_DOUBLE, i, 200, com, &status );
172 for(i=0;i<lvsize;i++){
174 std::cout << "[" << rank << "] vector[" << i << "]=" << vector[i] << std::endl;
175 sum += vector[i]*vector[i];
177 MPI_Reduce(&sum,&norm,1,MPI_DOUBLE,MPI_SUM,0,MPI_COMM_WORLD);
181 std::cout << "[" << grank << "] norm=" << norm << std::endl;
188 MPI_Recv(&etalon, 1, MPI_DOUBLE,size,400,com, &status);
189 MPI_Send(&norm,1,MPI_DOUBLE, size, 300, com);
193 MPI_Send(&norm,1,MPI_DOUBLE, 0, 400, com);
194 MPI_Recv(&etalon, 1, MPI_DOUBLE,0,300,com, &status);
200 MPI_Comm_disconnect( &com );
202 MPI_Unpublish_name((char*)service.c_str(), MPI_INFO_NULL, port_name);
203 MPI_Close_port( port_name );
212 if(fabs(norm-etalon)/norm < EPSILON ){
214 std::cout << "OK" << std::endl;
219 std::cout << "KO" << std::endl;