![]() | |||||||||||||
Messages in this thread |
On Sun, 26 Mar 2006, Ingo Molnar wrote: > > * Bill Huey <billh@gnuppy.monkey.org> wrote: > > > You'll need to do priority ceiling emulation as well. [...] > > i mentioned it further down in the text - PRIO_PROTECT support (which is > priority ceiling) is planned for pthread mutexes. It needs no further > kernel changes, it's a pure userspace thing. > Wouldn't this always include a call to sched_setscheduler() even for the fast path? And it would also involve assigning a priority to all locks up front. There are only 2 good reasons to choose this, as far as I can see. One is that it is more deterministic: The "fast path" is almost as slow as the slow path. So you will not be surprised by a sudden increase CPU use because timing is moved slightly. This is on the other hand something which can happen with PI. On UP there is usually no congestion with this mechanism if you avoid blocking when you have a lock as the task holding the lock will have higher priority than any other task interested in the lock. Esben > Ingo > - > 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/ > - 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: 2006-03-26 11:56 [from the cache] ©2003-2008 | |||||||||||||