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

new design for the doc and the sources: licence ...

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@661 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
legrand 2007-10-08 09:26:25 +00:00
commit 39cd826ea3
281 changed files with 9521 additions and 4839 deletions
Download patch file Download diff file Expand all files Collapse all files

186
trunk/paradiseo-peo/doc/html/scheduler_8cpp-source.html
View file

@ -1,6 +1,6 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>ParadisEO-PEO: scheduler.cpp Source File</title>
<title>ParadisEO-PEOMovingObjects: scheduler.cpp Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
@ -22,85 +22,113 @@
</form>
</li>
</ul></div>
<h1>scheduler.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// "sched_thread.cpp"</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// (c) OPAC Team, LIFL, August 2005</span>
<a name="l00004"></a>00004
<a name="l00005"></a>00005 <span class="comment">/* </span>
<a name="l00006"></a>00006 <span class="comment"> Contact: paradiseo-help@lists.gforge.inria.fr</span>
<a name="l00007"></a>00007 <span class="comment">*/</span>
<a name="l00008"></a>00008
<a name="l00009"></a>00009 <span class="preprocessor">#include &lt;queue&gt;</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="preprocessor">#include "scheduler.h"</span>
<a name="l00012"></a>00012 <span class="preprocessor">#include "tags.h"</span>
<a name="l00013"></a>00013 <span class="preprocessor">#include "mess.h"</span>
<a name="l00014"></a>00014 <span class="preprocessor">#include "../../core/peo_debug.h"</span>
<a name="l00015"></a>00015
<a name="l00016"></a>00016 <span class="keyword">static</span> std :: queue &lt;SCHED_RESOURCE&gt; resources; <span class="comment">/* Free resources */</span>
<a name="l00017"></a>00017
<a name="l00018"></a>00018 <span class="keyword">static</span> std :: queue &lt;SCHED_REQUEST&gt; requests; <span class="comment">/* Requests */</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="keyword">static</span> <span class="keywordtype">unsigned</span> initNumberOfRes = 0;
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="keywordtype">void</span> initScheduler () {
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i &lt; the_schema.size (); i ++) {
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="keyword">const</span> <a class="codeRef" doxygen="eo.doxytag:../../../paradiseo-eo/doc/html/" href="../../../paradiseo-eo/doc/html/class_node.html">Node</a> &amp; node = the_schema [i];
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keywordflow">if</span> (node.rk_sched == my_node -&gt; rk)
<a name="l00029"></a>00029 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j &lt; node.num_workers; j ++)
<a name="l00030"></a>00030 resources.push (std :: pair &lt;RANK_ID, WORKER_ID&gt; (i, j + 1));
<a name="l00031"></a>00031 }
<a name="l00032"></a>00032 initNumberOfRes = resources.size ();
<a name="l00033"></a>00033 }
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="keywordtype">bool</span> allResourcesFree () {
<h1>scheduler.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* </span>
<a name="l00002"></a>00002 <span class="comment">* &lt;scheduler.cpp&gt;</span>
<a name="l00003"></a>00003 <span class="comment">* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007</span>
<a name="l00004"></a>00004 <span class="comment">* (C) OPAC Team, LIFL, 2002-2007</span>
<a name="l00005"></a>00005 <span class="comment">*</span>
<a name="l00006"></a>00006 <span class="comment">* Sebastien Cahon, Alexandru-Adrian Tantar</span>
<a name="l00007"></a>00007 <span class="comment">*</span>
<a name="l00008"></a>00008 <span class="comment">* This software is governed by the CeCILL license under French law and</span>
<a name="l00009"></a>00009 <span class="comment">* abiding by the rules of distribution of free software. You can use,</span>
<a name="l00010"></a>00010 <span class="comment">* modify and/ or redistribute the software under the terms of the CeCILL</span>
<a name="l00011"></a>00011 <span class="comment">* license as circulated by CEA, CNRS and INRIA at the following URL</span>
<a name="l00012"></a>00012 <span class="comment">* "http://www.cecill.info".</span>
<a name="l00013"></a>00013 <span class="comment">*</span>
<a name="l00014"></a>00014 <span class="comment">* As a counterpart to the access to the source code and rights to copy,</span>
<a name="l00015"></a>00015 <span class="comment">* modify and redistribute granted by the license, users are provided only</span>
<a name="l00016"></a>00016 <span class="comment">* with a limited warranty and the software's author, the holder of the</span>
<a name="l00017"></a>00017 <span class="comment">* economic rights, and the successive licensors have only limited liability.</span>
<a name="l00018"></a>00018 <span class="comment">*</span>
<a name="l00019"></a>00019 <span class="comment">* In this respect, the user's attention is drawn to the risks associated</span>
<a name="l00020"></a>00020 <span class="comment">* with loading, using, modifying and/or developing or reproducing the</span>
<a name="l00021"></a>00021 <span class="comment">* software by the user in light of its specific status of free software,</span>
<a name="l00022"></a>00022 <span class="comment">* that may mean that it is complicated to manipulate, and that also</span>
<a name="l00023"></a>00023 <span class="comment">* therefore means that it is reserved for developers and experienced</span>
<a name="l00024"></a>00024 <span class="comment">* professionals having in-depth computer knowledge. Users are therefore</span>
<a name="l00025"></a>00025 <span class="comment">* encouraged to load and test the software's suitability as regards their</span>
<a name="l00026"></a>00026 <span class="comment">* requirements in conditions enabling the security of their systems and/or</span>
<a name="l00027"></a>00027 <span class="comment">* data to be ensured and, more generally, to use and operate it in the</span>
<a name="l00028"></a>00028 <span class="comment">* same conditions as regards security.</span>
<a name="l00029"></a>00029 <span class="comment">* The fact that you are presently reading this means that you have had</span>
<a name="l00030"></a>00030 <span class="comment">* knowledge of the CeCILL license and that you accept its terms.</span>
<a name="l00031"></a>00031 <span class="comment">*</span>
<a name="l00032"></a>00032 <span class="comment">* ParadisEO WebSite : http://paradiseo.gforge.inria.fr</span>
<a name="l00033"></a>00033 <span class="comment">* Contact: paradiseo-help@lists.gforge.inria.fr</span>
<a name="l00034"></a>00034 <span class="comment">*</span>
<a name="l00035"></a>00035 <span class="comment">*/</span>
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="keywordflow">return</span> resources.size () == initNumberOfRes;
<a name="l00038"></a>00038 }
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="keyword">static</span> <span class="keywordtype">void</span> update () {
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <span class="keywordtype">unsigned</span> num_alloc = std :: min (resources.size (), requests.size ());
<a name="l00043"></a>00043
<a name="l00044"></a>00044 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i &lt; num_alloc; i ++) {
<a name="l00045"></a>00045
<a name="l00046"></a>00046 SCHED_REQUEST req = requests.front ();
<a name="l00047"></a>00047 requests.pop ();
<a name="l00048"></a>00048
<a name="l00049"></a>00049 SCHED_RESOURCE res = resources.front ();
<a name="l00050"></a>00050 resources.pop ();
<a name="l00051"></a>00051
<a name="l00052"></a>00052 printDebugMessage (<span class="stringliteral">"allocating a resource."</span>);
<a name="l00053"></a>00053 initMessage ();
<a name="l00054"></a>00054 pack (req.second);
<a name="l00055"></a>00055 pack (res);
<a name="l00056"></a>00056 sendMessage (req.first, SCHED_RESULT_TAG);
<a name="l00057"></a>00057 }
<a name="l00058"></a>00058 }
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keywordtype">void</span> unpackResourceRequest () {
<a name="l00061"></a>00061
<a name="l00062"></a>00062 printDebugMessage (<span class="stringliteral">"queuing a resource request."</span>);
<a name="l00063"></a>00063 SCHED_REQUEST req;
<a name="l00064"></a>00064 unpack (req);
<a name="l00065"></a>00065 requests.push (req);
<a name="l00066"></a>00066 update ();
<a name="l00067"></a>00067 }
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="keywordtype">void</span> unpackTaskDone () {
<a name="l00070"></a>00070
<a name="l00071"></a>00071 printDebugMessage (<span class="stringliteral">"I'm notified a worker is now idle."</span>);
<a name="l00072"></a>00072 SCHED_RESOURCE res;
<a name="l00073"></a>00073 unpack (res);
<a name="l00074"></a>00074 resources.push (res);
<a name="l00075"></a>00075 <span class="keywordflow">if</span> (resources.size () == initNumberOfRes)
<a name="l00076"></a>00076 printDebugMessage (<span class="stringliteral">"all the resources are now free."</span>);
<a name="l00077"></a>00077 update ();
<a name="l00078"></a>00078 }
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Thu Jul 5 13:43:30 2007 for ParadisEO-PEO by&nbsp;
<a name="l00037"></a>00037 <span class="preprocessor">#include &lt;queue&gt;</span>
<a name="l00038"></a>00038
<a name="l00039"></a>00039 <span class="preprocessor">#include "scheduler.h"</span>
<a name="l00040"></a>00040 <span class="preprocessor">#include "tags.h"</span>
<a name="l00041"></a>00041 <span class="preprocessor">#include "mess.h"</span>
<a name="l00042"></a>00042 <span class="preprocessor">#include "../../core/peo_debug.h"</span>
<a name="l00043"></a>00043
<a name="l00044"></a>00044 <span class="keyword">static</span> std :: queue &lt;SCHED_RESOURCE&gt; resources; <span class="comment">/* Free resources */</span>
<a name="l00045"></a>00045
<a name="l00046"></a>00046 <span class="keyword">static</span> std :: queue &lt;SCHED_REQUEST&gt; requests; <span class="comment">/* Requests */</span>
<a name="l00047"></a>00047
<a name="l00048"></a>00048 <span class="keyword">static</span> <span class="keywordtype">unsigned</span> initNumberOfRes = 0;
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="keywordtype">void</span> initScheduler () {
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i &lt; the_schema.size (); i ++) {
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="keyword">const</span> <a class="codeRef" doxygen="eo.doxytag:http://eodev.sourceforge.net/eo/doc/html/" href="http://eodev.sourceforge.net/eo/doc/html/class_node.html">Node</a> &amp; node = the_schema [i];
<a name="l00055"></a>00055
<a name="l00056"></a>00056 <span class="keywordflow">if</span> (node.rk_sched == my_node -&gt; rk)
<a name="l00057"></a>00057 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j &lt; node.num_workers; j ++)
<a name="l00058"></a>00058 resources.push (std :: pair &lt;RANK_ID, WORKER_ID&gt; (i, j + 1));
<a name="l00059"></a>00059 }
<a name="l00060"></a>00060 initNumberOfRes = resources.size ();
<a name="l00061"></a>00061 }
<a name="l00062"></a>00062
<a name="l00063"></a>00063 <span class="keywordtype">bool</span> allResourcesFree () {
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="keywordflow">return</span> resources.size () == initNumberOfRes;
<a name="l00066"></a>00066 }
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keyword">static</span> <span class="keywordtype">void</span> update () {
<a name="l00069"></a>00069
<a name="l00070"></a>00070 <span class="keywordtype">unsigned</span> num_alloc = std :: min (resources.size (), requests.size ());
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i &lt; num_alloc; i ++) {
<a name="l00073"></a>00073
<a name="l00074"></a>00074 SCHED_REQUEST req = requests.front ();
<a name="l00075"></a>00075 requests.pop ();
<a name="l00076"></a>00076
<a name="l00077"></a>00077 SCHED_RESOURCE res = resources.front ();
<a name="l00078"></a>00078 resources.pop ();
<a name="l00079"></a>00079
<a name="l00080"></a>00080 printDebugMessage (<span class="stringliteral">"allocating a resource."</span>);
<a name="l00081"></a>00081 initMessage ();
<a name="l00082"></a>00082 pack (req.second);
<a name="l00083"></a>00083 pack (res);
<a name="l00084"></a>00084 sendMessage (req.first, SCHED_RESULT_TAG);
<a name="l00085"></a>00085 }
<a name="l00086"></a>00086 }
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="keywordtype">void</span> unpackResourceRequest () {
<a name="l00089"></a>00089
<a name="l00090"></a>00090 printDebugMessage (<span class="stringliteral">"queuing a resource request."</span>);
<a name="l00091"></a>00091 SCHED_REQUEST req;
<a name="l00092"></a>00092 unpack (req);
<a name="l00093"></a>00093 requests.push (req);
<a name="l00094"></a>00094 update ();
<a name="l00095"></a>00095 }
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="keywordtype">void</span> unpackTaskDone () {
<a name="l00098"></a>00098
<a name="l00099"></a>00099 printDebugMessage (<span class="stringliteral">"I'm notified a worker is now idle."</span>);
<a name="l00100"></a>00100 SCHED_RESOURCE res;
<a name="l00101"></a>00101 unpack (res);
<a name="l00102"></a>00102 resources.push (res);
<a name="l00103"></a>00103 <span class="keywordflow">if</span> (resources.size () == initNumberOfRes)
<a name="l00104"></a>00104 printDebugMessage (<span class="stringliteral">"all the resources are now free."</span>);
<a name="l00105"></a>00105 update ();
<a name="l00106"></a>00106 }
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Mon Oct 8 11:16:46 2007 for ParadisEO-PEOMovingObjects by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>