On Fri, Mar 04, 2005 at 09:45:56PM +0530, Andriy Tkachuk wrote:
Hi folks.
I wander how O(1) sheduling works in ULE.
In ule.pdf Jeff wrote:
Threads are picked from the current queue in
priority order until the current queue is empty.
As far as I understand the algorithm is O(n)
where
Hi folks.
I wander how O(1) sheduling works in ULE.
In ule.pdf Jeff wrote:
Threads are picked from the current queue in
priority order until the current queue is empty.
As far as I understand the algorithm is O(n)
where n - number of READY TO RUN processes,
not all processes isn't it?
thanks,
Hi folks.
I wander how O(1) sheduling works in ULE.
In ule.pdf Jeff wrote:
Threads are picked from the current queue in
priority order until the current queue is empty.
As far as I understand the algorithm is O(n)
where n - number of READY TO RUN processes,
not all processes isn't it?
thanks,
I haven't looked at it, but could it just be referring to retrieving a
thread from the queue. Just pulling something off a queue is a O(1)
operation. The order it places things in the queue probably is not. :)
On Mar 4, 2005, at 11:15 AM, Andriy Tkachuk wrote:
Hi folks.
I wander how O(1)
I haven't looked at it, but could it just be referring to retrieving a
thread from the queue. Just pulling something off a queue is a O(1)
operation. The order it places things in the queue probably is not. :)
You rihgt - just pulling something off a queue is a O(1) operation,
but before
5 matches
Mail list logo
