From: bloois@dutiws.twi.tudelft.nl (R.M.de Bloois.TI-OSGS-tel-01819-12030) Subject: Re: linux OS Date: Tue, 9 Feb 1993 22:56:44 GMT
In article <1993Feb6.044458.3424@news.acns.nwu.edu> hpa@nwu.edu (H. Peter Anvin) writes:
>In article <1ksepuINNjq1@tamsun.tamu.edu> of comp.os.linux,
> jkj0056@tamsun.tamu.edu (Jeffrey Kevin Jeansonne) writes:
>>
>> First of all, I was wondering how task scheduling is performed?
>> Also I read that TSS segments are used to provide multitasking.
>> What are they and how do they work?
>> This might sound like a silly question unless you are a unix
>> illiterate like myself.
>>
>
>Task scheduling is performed on a prioritized round robin schedule.
>The priority is based both on past execution times and a process'
>"nice" value.
>
In fact, by studying the source-code in Linux 0.98.1 I found the
following:
1. The priority in Linux is not dynamically adapted based on
past execution, at all.
2. The lengths of the time-slices that linux assign to tasks
are directly proportional to the priority of each task
(higher priority means bigger time-slices)
Not many people use nice. So, in effect, Linux does not use
priorities (unless you use nice-values).
>
>
>--
>INTERNET: hpa@nwu.edu TALK: hpa@merle.acns.nwu.edu
>BITNET: HPA@NUACC IBMNET: 16331@IBMX400
>HAM RADIO: N9ITP SM4TKN NeXTMAIL: hpa@speedy.acns.nwu.edu
>Linux: a free UNIX clone for the 386. Get yours today from tsx-11.mit.edu!
INTERNET: bloois@dutiws.tudelft.twi.nl