node.cpp

00001 /* 
00002 * <node.cpp>
00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
00004 * (C) OPAC Team, LIFL, 2002-2007
00005 *
00006 * Sebastien Cahon, Alexandru-Adrian Tantar
00007 *
00008 * This software is governed by the CeCILL license under French law and
00009 * abiding by the rules of distribution of free software.  You can  use,
00010 * modify and/ or redistribute the software under the terms of the CeCILL
00011 * license as circulated by CEA, CNRS and INRIA at the following URL
00012 * "http://www.cecill.info".
00013 *
00014 * As a counterpart to the access to the source code and  rights to copy,
00015 * modify and redistribute granted by the license, users are provided only
00016 * with a limited warranty  and the software's author,  the holder of the
00017 * economic rights,  and the successive licensors  have only  limited liability.
00018 *
00019 * In this respect, the user's attention is drawn to the risks associated
00020 * with loading,  using,  modifying and/or developing or reproducing the
00021 * software by the user in light of its specific status of free software,
00022 * that may mean  that it is complicated to manipulate,  and  that  also
00023 * therefore means  that it is reserved for developers  and  experienced
00024 * professionals having in-depth computer knowledge. Users are therefore
00025 * encouraged to load and test the software's suitability as regards their
00026 * requirements in conditions enabling the security of their systems and/or
00027 * data to be ensured and,  more generally, to use and operate it in the
00028 * same conditions as regards security.
00029 * The fact that you are presently reading this means that you have had
00030 * knowledge of the CeCILL license and that you accept its terms.
00031 *
00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
00033 * Contact: paradiseo-help@lists.gforge.inria.fr
00034 *
00035 */
00036 
00037 #include <mpi.h>
00038 #include <vector>
00039 #include <map>
00040 #include <string>
00041 #include <cassert>
00042 
00043 static int rk, sz; /* Rank & size */
00044 
00045 static std :: map <std :: string, int> name_to_rk;
00046 
00047 static std :: vector <std :: string> rk_to_name;
00048 
00049 int getNodeRank () {
00050 
00051   return rk;
00052 }
00053 
00054 int getNumberOfNodes () {
00055 
00056   return sz;
00057 }
00058 
00059 int getRankFromName (const std :: string & __name) {
00060   
00061   return atoi (__name.c_str ());  
00062 }
00063 
00064 void initNode (int * __argc, char * * * __argv) {
00065   
00066   int provided;
00067   MPI_Init_thread (__argc,  __argv, MPI_THREAD_FUNNELED, & provided);  
00068   assert (provided == MPI_THREAD_FUNNELED); /* The MPI implementation must be multi-threaded.
00069                                                Yet, only one thread performs the comm.
00070                                                operations */
00071   MPI_Comm_rank (MPI_COMM_WORLD, & rk);   /* Who ? */
00072   MPI_Comm_size (MPI_COMM_WORLD, & sz);    /* How many ? */
00073 
00074   char names [sz] [MPI_MAX_PROCESSOR_NAME];
00075   int len;
00076 
00077   /* Processor names */ 
00078   MPI_Get_processor_name (names [0], & len);   /* Me */  
00079   MPI_Allgather (names, MPI_MAX_PROCESSOR_NAME, MPI_CHAR, names, MPI_MAX_PROCESSOR_NAME, MPI_CHAR, MPI_COMM_WORLD); /* Broadcast */
00080   
00081   for (int i = 0; i < sz; i ++) {
00082     rk_to_name.push_back (names [i]);
00083     name_to_rk [names [i]] = i;
00084   }
00085 }
00086 

Generated on Mon Oct 8 11:16:45 2007 for ParadisEO-PEOMovingObjects by  doxygen 1.4.7