rogue@well.UUCP (L. Brett Glass) (03/17/88)
I've received a few responses so far to my query regarding UNIX scheduling
algorithms, all detailing the techniques used in implementations of
UNIX System V. However, I've received no information about 4.2 or 4.3
BSD, and am interested in finding out how (if at all) the scheduling
algorithms used in these versions differ.
If any BSD gurus out there are familiar with these algorithms, please
send me mail here on the WELL. The best return path is
{ihnp4 | uunet}!lll-winken!well!rogue
or, from Internet nodes or machines that understand domains,
lll-winken.llnl.gov!well!rogue
Any and all responses will be much appreciated....
<rogue>bd@hpsemc.HP.COM (bob desinger) (03/25/88)
L. Brett Glass (rogue@well.UUCP) writes: > I've received a few responses so far to my query regarding UNIX scheduling > algorithms, all detailing the techniques used in implementations of > UNIX System V. However, I've received no information about 4.2 or 4.3 > BSD, and am interested in finding out how (if at all) the scheduling > algorithms used in these versions differ. See John S. Quarterman's excellent article in _ACM_Computing_Surveys_, vol. 17, number 4 (December 1985), "4.2BSD and 4.3BSD as Examples of the UNIX System." -- bd