Re: Make yield_task_fair more efficient
- From: Ingo Molnar <mingo@xxxxxxx>
- Date: Thu, 21 Feb 2008 07:04:27 +0100
* Balbir Singh <balbir@xxxxxxxxxxxxxxxxxx> 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
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
- Follow-Ups:
- Re: Make yield_task_fair more efficient
- From: Balbir Singh
- Re: Make yield_task_fair more efficient
- References:
- Make yield_task_fair more efficient
- From: Balbir Singh
- Make yield_task_fair more efficient
- Prev by Date: RE: [git patches] net driver updates
- Next by Date: Re: 2.6.25-rc2 System no longer powers off after suspend-to-disk. Screen becomes green.
- Previous by thread: Make yield_task_fair more efficient
- Next by thread: Re: Make yield_task_fair more efficient
- Index(es):
Relevant Pages
|
Loading