<div dir="ltr">If you are not in the kernel, you might with to consider slurm or the lesser ones ((open)PBS, torque), condor, boinc.<div style>If you need really complex things (dependencies), you need a scientific flow manager such as kepler.</div>
</div><div class="gmail_extra"><br><br><div class="gmail_quote">On Sun, Apr 7, 2013 at 2:27 PM, ik <span dir="ltr"><<a href="mailto:idokan@gmail.com" target="_blank">idokan@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div dir="ltr"><div><div><div><div>Hello,<br><br></div>I have a very complex queue management requirements, I need to calculate task weight, time restrictions for execution, number of possible execution at given time, changes of the data when it is inside the queue and even disabling specific task.<br>
</div><div>some tasks have very short time to live, and required to be executed faster, then others. but it's not a "simple" priority queue.<br></div><div><br></div>I'm looking for known algorithms for such tasks, such as bfs (at the kernel) for example and more, and wonder if someone can point me to a list or more resources to learn about queue management, and find the proper way (or closer way) to implement my needs<br>
<br></div>Thanks<br></div>Ido<br></div>
<br>_______________________________________________<br>
Linux-il mailing list<br>
<a href="mailto:Linux-il@cs.huji.ac.il">Linux-il@cs.huji.ac.il</a><br>
<a href="http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il" target="_blank">http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il</a><br>
<br></blockquote></div><br><br clear="all"><div><br></div>-- <br>Orna Agmon Ben-Yehuda.<br><a href="http://ladypine.org">http://ladypine.org</a>
</div>