Date: Fri, 4 Mar 2005 19:46:38 -0500 From: Lucas Holt <luke@foolishgames.com> To: "Andriy Tkachuk" <ant@emict.com> Cc: freebsd-hackers@freebsd.org Subject: Re: sched_ule, runqueues, priority, and O(1) sheduling question Message-ID: <a73e8d143c59131013c441be42bbc5f4@foolishgames.com> In-Reply-To: <000401c520d5$a6b6ae00$090210ac@BORJA> References: <000401c520d5$a6b6ae00$090210ac@BORJA>
next in thread | previous in thread | raw e-mail | index | archive | help
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@freebsd.org mailing list > http://lists.freebsd.org/mailman/listinfo/freebsd-hackers > To unsubscribe, send any mail to > "freebsd-hackers-unsubscribe@freebsd.org" > > Lucas Holt Luke@FoolishGames.com ________________________________________________________ FoolishGames.com (Jewel Fan Site) JustJournal.com (Free blogging) FoolishGames.net (Enemy Territory IoM site)
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?a73e8d143c59131013c441be42bbc5f4>