lkml.org 
[lkml]   [2002]   [Jun]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: Question about sched_yield()
From
Date
On Mon, 2002-06-17 at 17:46, David Schwartz wrote:

> You seem to have a misconception about what sched_yield is for.
> It is not a replacement for blocking or a scheduling priority
> adjustment. It simply lets other ready-to-run tasks be scheduled
before returning to the current task.
>
> Here's a quote from SuS3:
>
> "The sched_yield() function shall force the running thread to relinquish the
> processor until it again becomes the head of its thread list. It takes no
> arguments."
>
> This neither says nor implies anything about CPU usage. It simply says
> that the current thread will yield and be put at the end of the list.

And you seem to have a misconception about sched_yield, too. If a
machine has n tasks, half of which are doing CPU-intense work and the
other half of which are just yielding... why on Earth would the yielding
tasks get any noticeable amount of CPU use?

Seems to me the behavior of sched_yield is a bit broken. If the tasks
are correctly returned to the end of their runqueue, this should not
happen. Note, for example, you will not see this behavior in 2.5.

Quite frankly, even if the supposed standard says nothing of this... I
do not care: calling sched_yield in a loop should not show up as a CPU
hog.

Robert Love

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:26    [from the cache]
©2003-2011 Jasper Spaans