![]() | |||||||||||||
Messages in this thread |
On Sat, Oct 09, 2004 at 02:30:28PM -0400, Lee Revell wrote: > On Sat, 2004-10-09 at 13:41, Karim Yaghmour wrote: > > Sven-Thorsten Dietrich wrote: > > > - Voluntary Preemption by Ingo Molnar > > > - IRQ thread patches by Scott Wood and Ingo Molnar > > > - BKL mutex patch by Ingo Molnar (with MV extensions) > > > - PMutex from Germany's Universitaet der Bundeswehr, Munich > > > - MontaVista mutex abstraction layer replacing spinlocks with mutexes > > > > To the best of my understanding, this still doesn't provide deterministic > > hard-real-time performance in Linux. > > Using only the VP+IRQ thread patch, I ran my RT app for 11 million > cycles yesterday, with a maximum delay of 190 usecs. How would this not > satisfy a 200 usec hard RT constraint? I think the keyword here is "deterministic", isn't it? > > PHB: "I've looked at your proposal and decided it can't be done" > Dilbert: "I just did it. It's working perfectly" > > Lee > > - > 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/ -- Stefan Eletzhofer InQuant Data GBR http://www.inquant.de +49 (0) 751 35 44 112 +49 (0) 171 23 24 529 (Mobil) +49 (0) 751 35 44 115 (FAX) - 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 14:06 [from the cache] ©2003-2008 | |||||||||||||