Scheduler

Hello, everybody!

What is the current progress in scheduler design? Is there any description 
of the final version of the algotithm Andre designed?

The requested time complexity is O(1). But we have a limited N, so the 
asymptotic estimation can't provide us with good results. Formally, any 
algorithm including O(N*N) can be shown as O(1) because N is limited to 
2^12.

I suggest including O(log(N)) algorithms in the candidate list, because they 
may be quite simple and provide a better speed in the mean. I have at least 
one in my mind...

Also, as far as I know, improved scheduling techniques work with priority 
queues. And here we obtain Q - priority queues number. Are we to include Q 
into the algorithms complexity even if Q is also limited to 120?

With respect to Haiku community,
Dmitry Malyshev
                


-----------------
Что будет, если соединить что-то очень мягкое и что-то очень жесткое? 
http://xpycteam.astronim.com


-------------------------------------------------------------------------
This SF.net email is sponsored by: Splunk Inc.
Still grepping through log files to find problems?  Stop.
Now Search log events and configuration files using AJAX and a browser.
Download your FREE copy of Splunk now >> http://get.splunk.com/
_______________________________________________
Open-beos-kernel-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/open-beos-kernel-devel