If you are not in the kernel, you might with to consider slurm or the lesser ones ((open)PBS, torque), condor, boinc. If you need really complex things (dependencies), you need a scientific flow manager such as kepler.
On Sun, Apr 7, 2013 at 2:27 PM, ik <[email protected]> wrote: > Hello, > > 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. > some tasks have very short time to live, and required to be executed > faster, then others. but it's not a "simple" priority queue. > > 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 > > Thanks > Ido > > _______________________________________________ > Linux-il mailing list > [email protected] > http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il > > -- Orna Agmon Ben-Yehuda. http://ladypine.org
_______________________________________________ Linux-il mailing list [email protected] http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il
