queue management algorithms

[ik]

On Sun, Apr 7, 2013 at 2:39 PM, Orna Agmon Ben-Yehuda <ladypine at gmail.com>wrote:

> If you are not in the kernel,
>

 Userspace all the way. Actually never touched 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.
>

Thanks, I'll take a look at them.

Ido


>
>
> On Sun, Apr 7, 2013 at 2:27 PM, ik <idokan at gmail.com> 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
>> Linux-il at cs.huji.ac.il
>> http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il
>>
>>
>
>
> --
> Orna Agmon Ben-Yehuda.
> http://ladypine.org
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.huji.ac.il/pipermail/linux-il/attachments/20130407/a95e8f97/attachment.html>