lkml.org 
[lkml]   [2008]   [Feb]   [21]   [last100]   RSS Feed
Views: [more markup]  [less markup]  [headers]  [forward] 
 
Messages in this thread
/
DateThu, 21 Feb 2008 07:04:27 +0100
FromIngo Molnar <>
SubjectRe: Make yield_task_fair more efficient
* Balbir Singh <balbir@linux.vnet.ibm.com> wrote:

> __pick_last_entity() walks the entire tree on O(lgn) time to find the 
> rightmost entry. This patch makes the routine more efficient by 
> reducing the cost of the lookup

hm, i'm not sure we want to do this: we'd be slowing down the fastpath 
of all the other common scheduler functions, for the sake of a rarely 
used (and broken ...) API: yield. And note that an rbtree walk is not 
slow at all - if you are yielding frequently it's probably all cached.

	Ingo


\
 
 \ /
  Last update: 2008-02-21 07:07    [from the cache]
©2003-2008