Return to BSD News archive
Xref: sserve comp.unix.bsd:12754 comp.sys.sun.misc:10154 comp.unix.questions:40495 comp.unix.misc:9586
Path: sserve!newshost.anu.edu.au!munnari.oz.au!news.Hawaii.Edu!ames!elroy.jpl.nasa.gov!swrinde!cs.utexas.edu!uunet!bloom-beacon.mit.edu!senator-bedfellow.mit.edu!thomasl
From: thomasl@mtl.mit.edu (Thomas J Lohman)
Newsgroups: comp.os.theory,comp.unix.bsd,comp.sys.sun.misc,comp.unix.questions,comp.unix.misc
Subject: process scheduling algorithms for Unix (SunOS 4.1.3 and 4.3BSD)
Date: 14 Oct 1993 18:07:35 GMT
Organization: MIT Microsystems Technology Laboratories
Lines: 24
Distribution: world
Message-ID: <29k4h7$8ik@senator-bedfellow.MIT.EDU>
NNTP-Posting-Host: garcon.mit.edu
I'd like to thank everyone for pointing me toward information on the
implementation of SunOS 4.1.3. I have found articles and references
on the virtual memory architecture, as well as the v-node file
system architecture. I have also tracked down stuff on the specific
system (SS10 - sun4m) architecture that I use. One thing which I cannot
locate any information on is the process scheduling algorithm used.
I was told it is very similar to BSD 4.3 and that should suffice but the one
thing I am curious to know is whether multi-processors are taken into account.
Because the sun4m architecture is a multi-processor architecture, there
must be changes to the algorithm in order to schedule processes onto the
different CPUs. In the simplest case, it could just move a process to
the most available CPU but what if the process had been previously
running on another CPU? What would happen to the caching? If anyone
knows of any papers or references which give a good overview without
requiring a ton of knowledge, please let me know. I would be very grateful,
and thanks again to everyone who has responded to my earlier queries.
--tom
--
Thomas Lohman - Research Specialist
MIT Building 36 - Room 297
Cambridge, MA. 02139
e-mail: thomasl@mtl.mit.edu, Phone: 617-258-6485