sched_ule, runqueues, priority, and O(1) sheduling question

[Lucas Holt]

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) 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,
>  Andriy.
> _______________________________________________
> freebsd-hackers at freebsd.org mailing list
> http://lists.freebsd.org/mailman/listinfo/freebsd-hackers
> To unsubscribe, send any mail to 
> "freebsd-hackers-unsubscribe at freebsd.org"
>
>

Lucas Holt
Luke at FoolishGames.com
________________________________________________________
FoolishGames.com  (Jewel Fan Site)
JustJournal.com (Free blogging)
FoolishGames.net (Enemy Territory IoM site)