- Main Page
- Namespaces
- Classes
- Files

- Search for |

# scheduler.cpp

    00001 /*
    00002 * <scheduler.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 <queue>
    00038
    00039 #include "scheduler.h"
    00040 #include "tags.h"
    00041 #include "mess.h"
    00042 #include "../../core/peo_debug.h"
    00043
    00044 static std :: queue <SCHED_RESOURCE> resources; /* Free resources */
    00045
    00046 static std :: queue <SCHED_REQUEST> requests; /* Requests */
    00047
    00048 static unsigned initNumberOfRes = 0;
    00049
    00050 void initScheduler () {
    00051
    00052   for (unsigned i = 0; i < the_schema.size (); i ++) {
    00053
    00054     const Node & node = the_schema [i];
    00055
    00056     if (node.rk_sched == my_node -> rk)
    00057       for (unsigned j = 0; j < node.num_workers; j ++)
    00058         resources.push (std :: pair <RANK_ID, WORKER_ID> (i, j + 1));
    00059   }
    00060   initNumberOfRes = resources.size ();
    00061 }
    00062
    00063 bool allResourcesFree () {
    00064
    00065   return resources.size () == initNumberOfRes;
    00066 }
    00067
    00068 static void update () {
    00069
    00070   unsigned num_alloc = std :: min (resources.size (), requests.size ());
    00071
    00072   for (unsigned i = 0; i < num_alloc; i ++) {
    00073
    00074     SCHED_REQUEST req = requests.front ();
    00075     requests.pop ();
    00076
    00077     SCHED_RESOURCE res = resources.front ();
    00078     resources.pop ();
    00079
    00080     printDebugMessage ("allocating a resource.");
    00081     initMessage ();
    00082     pack (req.second);
    00083     pack (res);
    00084     sendMessage (req.first, SCHED_RESULT_TAG);
    00085   }
    00086 }
    00087
    00088 void unpackResourceRequest () {
    00089
    00090   printDebugMessage ("queuing a resource request.");
    00091   SCHED_REQUEST req;
    00092   unpack (req);
    00093   requests.push (req);
    00094   update ();
    00095 }
    00096
    00097 void unpackTaskDone () {
    00098
    00099   printDebugMessage ("I'm notified a worker is now idle.");
    00100   SCHED_RESOURCE res;
    00101   unpack (res);
    00102   resources.push (res);
    00103   if (resources.size () == initNumberOfRes)
    00104     printDebugMessage ("all the resources are now free.");
    00105   update ();
    00106 }