Date: Wed, 26 Jul 95 15:09:58 MDT From: terry@cs.weber.edu (Terry Lambert) To: Marino.Ladavac@aut.alcatel.at Cc: davidg@root.com, freebsd-hackers@freebsd.org Subject: Re: Scheduling Algorithms (was: Re: panic in brelse() ... ) Message-ID: <9507262109.AA23296@cs.weber.edu> In-Reply-To: <9507261747.AA02751@atuhc16.aut.alcatel.at> from "Marino.Ladavac@aut.alcatel.at" at Jul 26, 95 07:47:49 pm
next in thread | previous in thread | raw e-mail | index | archive | help
[ ... a proposed linear reduction scheduling algorithm ... ] [ ... the BSD 4.4 algorithm ... ] [ ... the current FreeBSD modified BSD 4,.4 algorithm ... ] [ ... the Amiga time base promotion algorithm ... ] I think all of these algorithms miss the boat, if we are to be able to support RT scheduling and SMP scheduling. The main issue in both of these tasks that are on the table is a divorce of the ready-to-run state from the act of running the code. I think that this really implies seperate queues based on priority. It's necessary because multiple processes can be in the run state (for SMP, or even for kernel premption), and RT processes have to be able to be pigs as much as they want (if they are supported). Terry Lambert terry@cs.weber.edu --- Any opinions in this posting are my own and not those of my present or previous employers.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?9507262109.AA23296>