| <html lang="en"> |
| <head> |
| <title>Traditional Scheduling - The GNU C Library</title> |
| <meta http-equiv="Content-Type" content="text/html"> |
| <meta name="description" content="The GNU C Library"> |
| <meta name="generator" content="makeinfo 4.13"> |
| <link title="Top" rel="start" href="index.html#Top"> |
| <link rel="up" href="Priority.html#Priority" title="Priority"> |
| <link rel="prev" href="Basic-Scheduling-Functions.html#Basic-Scheduling-Functions" title="Basic Scheduling Functions"> |
| <link rel="next" href="CPU-Affinity.html#CPU-Affinity" title="CPU Affinity"> |
| <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage"> |
| <!-- |
| This file documents the GNU C library. |
| |
| This is Edition 0.12, last updated 2007-10-27, |
| of `The GNU C Library Reference Manual', for version |
| 2.8 (Sourcery G++ Lite 2011.03-41). |
| |
| Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2001, 2002, |
| 2003, 2007, 2008, 2010 Free Software Foundation, Inc. |
| |
| Permission is granted to copy, distribute and/or modify this document |
| under the terms of the GNU Free Documentation License, Version 1.3 or |
| any later version published by the Free Software Foundation; with the |
| Invariant Sections being ``Free Software Needs Free Documentation'' |
| and ``GNU Lesser General Public License'', the Front-Cover texts being |
| ``A GNU Manual'', and with the Back-Cover Texts as in (a) below. A |
| copy of the license is included in the section entitled "GNU Free |
| Documentation License". |
| |
| (a) The FSF's Back-Cover Text is: ``You have the freedom to |
| copy and modify this GNU manual. Buying copies from the FSF |
| supports it in developing GNU and promoting software freedom.''--> |
| <meta http-equiv="Content-Style-Type" content="text/css"> |
| <style type="text/css"><!-- |
| pre.display { font-family:inherit } |
| pre.format { font-family:inherit } |
| pre.smalldisplay { font-family:inherit; font-size:smaller } |
| pre.smallformat { font-family:inherit; font-size:smaller } |
| pre.smallexample { font-size:smaller } |
| pre.smalllisp { font-size:smaller } |
| span.sc { font-variant:small-caps } |
| span.roman { font-family:serif; font-weight:normal; } |
| span.sansserif { font-family:sans-serif; font-weight:normal; } |
| --></style> |
| <link rel="stylesheet" type="text/css" href="../cs.css"> |
| </head> |
| <body> |
| <div class="node"> |
| <a name="Traditional-Scheduling"></a> |
| <p> |
| Next: <a rel="next" accesskey="n" href="CPU-Affinity.html#CPU-Affinity">CPU Affinity</a>, |
| Previous: <a rel="previous" accesskey="p" href="Basic-Scheduling-Functions.html#Basic-Scheduling-Functions">Basic Scheduling Functions</a>, |
| Up: <a rel="up" accesskey="u" href="Priority.html#Priority">Priority</a> |
| <hr> |
| </div> |
| |
| <h4 class="subsection">22.3.4 Traditional Scheduling</h4> |
| |
| <p><a name="index-scheduling_002c-traditional-2754"></a> |
| This section is about the scheduling among processes whose absolute |
| priority is 0. When the system hands out the scraps of CPU time that |
| are left over after the processes with higher absolute priority have |
| taken all they want, the scheduling described herein determines who |
| among the great unwashed processes gets them. |
| |
| <ul class="menu"> |
| <li><a accesskey="1" href="Traditional-Scheduling-Intro.html#Traditional-Scheduling-Intro">Traditional Scheduling Intro</a> |
| <li><a accesskey="2" href="Traditional-Scheduling-Functions.html#Traditional-Scheduling-Functions">Traditional Scheduling Functions</a> |
| </ul> |
| |
| </body></html> |
| |
