1 .\" Copyright (C) Tom Bjorkholm & Markus Kuhn, 1996
3 .\" %%%LICENSE_START(GPLv2+_DOC_FULL)
4 .\" This is free documentation; you can redistribute it and/or
5 .\" modify it under the terms of the GNU General Public License as
6 .\" published by the Free Software Foundation; either version 2 of
7 .\" the License, or (at your option) any later version.
9 .\" The GNU General Public License's references to "object code"
10 .\" and "executables" are to be interpreted as the output of any
11 .\" document formatting or typesetting system, including
12 .\" intermediate and printed output.
14 .\" This manual is distributed in the hope that it will be useful,
15 .\" but WITHOUT ANY WARRANTY; without even the implied warranty of
16 .\" MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 .\" GNU General Public License for more details.
19 .\" You should have received a copy of the GNU General Public
20 .\" License along with this manual; if not, see
21 .\" <http://www.gnu.org/licenses/>.
24 .\" 1996-04-01 Tom Bjorkholm <tomb@mydata.se>
25 .\" First version written
26 .\" 1996-04-10 Markus Kuhn <mskuhn@cip.informatik.uni-erlangen.de>
29 .TH SCHED_GET_PRIORITY_MAX 2 2013-09-23 "Linux" "Linux Programmer's Manual"
31 sched_get_priority_max, sched_get_priority_min \- get static priority range
35 .BI "int sched_get_priority_max(int " policy );
37 .BI "int sched_get_priority_min(int " policy );
39 .BR sched_get_priority_max ()
40 returns the maximum priority value that can be used with the
41 scheduling algorithm identified by
43 .BR sched_get_priority_min ()
44 returns the minimum priority value that can be used with the
45 scheduling algorithm identified by
56 Further details about these policies can be found in
57 .BR sched_setscheduler (2).
59 Processes with numerically higher priority values are scheduled before
60 processes with numerically lower priority values.
63 .BR sched_get_priority_max ()
64 will be greater than the
66 .BR sched_get_priority_min ().
68 Linux allows the static priority value range 1 to 99 for
72 and the priority 0 for
77 Scheduling priority ranges for the various policies
80 The range of scheduling priorities may vary on other POSIX systems,
81 thus it is a good idea for portable applications to use a virtual
82 priority range and map it to the interval given by
83 .BR sched_get_priority_max ()
85 .BR sched_get_priority_min ().
86 POSIX.1-2001 requires a spread of at least 32 between the maximum and the
92 POSIX systems on which
93 .BR sched_get_priority_max ()
95 .BR sched_get_priority_min ()
97 .B _POSIX_PRIORITY_SCHEDULING
102 .BR sched_get_priority_max ()
104 .BR sched_get_priority_min ()
105 return the maximum/minimum priority value for the named scheduling
107 On error, \-1 is returned, and
109 is set appropriately.
115 does not identify a defined scheduling policy.
121 .BR sched_getaffinity (2),
122 .BR sched_getparam (2),
123 .BR sched_getscheduler (2),
124 .BR sched_setaffinity (2),
125 .BR sched_setparam (2),
126 .BR sched_setscheduler (2)
128 .I Programming for the real world \- POSIX.4
129 by Bill O. Gallmeister, O'Reilly & Associates, Inc., ISBN 1-56592-074-0.
131 This page is part of release 3.65 of the Linux
134 A description of the project,
135 and information about reporting bugs,
137 \%http://www.kernel.org/doc/man\-pages/.