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_YIELD 2 2017-09-15 "Linux" "Linux Programmer's Manual"
31 sched_yield \- yield the processor
35 .B int sched_yield(void);
38 causes the calling thread to relinquish the CPU.
39 The thread is moved to the end of the queue for its static
40 priority and a new thread gets to run.
45 On error, \-1 is returned, and
49 In the Linux implementation,
53 POSIX.1-2001, POSIX.1-2008.
55 If the calling thread is the only thread in the highest
56 priority list at that time,
57 it will continue to run after a call to
60 POSIX systems on which
63 .B _POSIX_PRIORITY_SCHEDULING
69 can improve performance by giving other threads or processes
70 a chance to run when (heavily) contended resources (e.g., mutexes)
71 have been released by the caller.
74 unnecessarily or inappropriately
75 (e.g., when resources needed by other
76 schedulable threads are still held by the caller),
77 since doing so will result in unnecessary context switches,
78 which will degrade system performance.
81 is intended for use with real-time scheduling policies (i.e.,
87 with nondeterministic scheduling policies such as
89 is unspecified and very likely means your application design is broken.