[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Kernel Scheduling

>If there are three users A,B,C then each will get 33 percent of the 
>CPU. If A has 5 processes then they will share A's 33%, and will be 
>scheduled in the traditional way. If B has only one process then it 
>will get the entire 33% assigned to B and so on... Can anyone please 
>suggest any ideas.


i haven't looked at linux scheduler in a long while, but i think it 
would be easier to have a diferent process queue for each user

AFAIR, a simple round-robin scheduler maintains a FIFO queue; picks 
the topmost process to execute, and puts it back in the end after its 
time is used up (or is blocked)

further refinements include maintaining a diferent queue for each 
priority level, and lots of extra smartness

just replicate all those queues, tables etc. one structure for each 
user, and do a round-robin between those

<DISCLAIMER> I've never written a scheduler </DISCLAIMER>
------
Javier
-- 
-----BEGIN GEEK CODE BLOCK-----
Version: 3.1
GCS/S d- s+:-- a C+++$ UL++++$ P+ L+++$ E W+++$ N- o? K? w--- O-
M+++$ V- PS PE Y+ PGP- t+ 5- X+ R- !tv b+++ DI+++ D G+ e? h! r++ y+
------END GEEK CODE BLOCK------
--
Kernelnewbies: Help each other learn about the Linux kernel.
Archive:       http://mail.nl.linux.org/kernelnewbies/
FAQ:           http://kernelnewbies.org/faq/