lkml.org 
[lkml]   [1999]   [May]   [31]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: O(1) scheduler
Date


>>The run-priority of processes is determined by fine-grain time
>>accounting. The scheduler would read the RTSC register (or the timer
>>chip internal counter on pre-Pentium processors) once each time it needs
>>rescheduling, and decrease the time budget of the currently active by
>>the amount of time the process has been run. If the integer part (run
>>priority) decreases, the process has to be moved to another bucket, and
>>there is inserted at the front. Now the scheduler would schedule the
>>first process in the highest bucket.
>
>This has some problems:
>
>- old CPUs that don't have a TSC, so you need a fall back.
>- the standard TSC counts interrupts and bottom halves too. It would
>be unfair to charge them to a process (I believe the SMP scheduler in 2.2
>has the same problem)


I think the idea is good, even if We don't have a TSC ( We can count timer
tics for example ).
The _really_ important deal is avoid linear scan of process list.

All this, is of course, IMVHO.

Cheers,
Davide.




-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:52    [W:0.028 / U:0.056 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site