yah i read it when i was going thr'ugh schedule(r).
it came in the midst of goto(s).
but i feel it is for making out the worth of process to acquire cpu(esp. in
real time).
as far as i know the O notation uses usually for/if/while etc
(i know that it all depends on the satatement which you want to take).
which take much time to determine the efficiency of prose.
how can we say it is O(n), when we do not consider whole algo. of scheduler.
only on a basis of a single call, which is to determine can_schedule running
through the running queue.
>Arun Sharma wrote:
>n processes on the run queue, goodness gets called for each one, hence
>O(n).
this determines for the goodness function or for the scheduler.
please rectify if i am wrong and clarify.
with regards,
thanks in advance.
-gaurav.
--
_
|^|^| -^- Love to Linux
\-/ G A U R A V |
mailto:[EMAIL PROTECTED] / mailto:[EMAIL PROTECTED]
| Sea/She is nature's art/\/ Everybody likes to get the feel of it
|-=-----------------------/-----------------------------------------|
|_|f I can I m a g i n/e it I can A c h i e v e it_._.-.-._.|
-----------------------------------------------------------------------
For more information on the LIH mailing list see:
http://lists.linux-india.org/lists/LIH
