Mail Archive Search: <+subject:/^(?:^\s*(re|sv|fwd|fw)[\[\]\d]*[:>-]+\s*)*RT\s+and\s+XFS\s*$/>

Results:

References: [ +subject:/^(?:^\s*(re|sv|fwd|fw)[\[\]\d]*[:>-]+\s*)*RT\s+and\s+XFS\s*$/: 32 ]

Total 32 documents matching your query.

21. Re: RT and XFS (score: 1): Author: Daniel Walker <dwalker@xxxxxxxxxx>; Date: Thu, 14 Jul 2005 08:56:58 -0700; This reminds me of Documentation/stable_api_nonsense.txt . That no one should really be dependent on a particular kernel API doing a particular thing. The kernel is play dough for the kernel hacker (; /archives/xfs/2005-07/msg00232.html (10,836 bytes)
22. Re: RT and XFS (score: 1): Author: Christoph Hellwig <hch@xxxxxxxxxxxxx>; Date: Thu, 14 Jul 2005 17:08:38 +0100; --end quoted text--; /archives/xfs/2005-07/msg00233.html (12,731 bytes)
23. Re: RT and XFS (score: 1): Author: Christoph Hellwig <hch@xxxxxxxxxxxxx>; Date: Thu, 14 Jul 2005 17:08:35 +0100; Daniel, get a fucking clue. Read some CS 101 literature on what a semaphore is defined to be. If you want PI singing dancing blinking christmas tree locking primites call them a mutex, but not a sema; /archives/xfs/2005-07/msg00234.html (11,377 bytes)
24. Re: RT and XFS (score: 1): Author: Ingo Molnar <mingo@xxxxxxx>; Date: Fri, 15 Jul 2005 12:23:11 +0200; that's just plain wrong. PI might be good if one cares about priorities and worst-case latencies, but most of the time the kernel is plain good enough and we dont care. PI can also be pretty expensiv; /archives/xfs/2005-07/msg00237.html (9,706 bytes)
25. Re: RT and XFS (score: 1): Author: Daniel Walker <dwalker@xxxxxxxxxx>; Date: Fri, 15 Jul 2005 09:16:55 -0700; I don't agree with that. But of course I'm always speaking from a real time perspective . PI is expensive , but it won't always be. However, no one is forcing PI on anyone, even if I think it's good; /archives/xfs/2005-07/msg00240.html (10,059 bytes)
26. Re: RT and XFS (score: 1): Author: Esben Nielsen <simlo@xxxxxxxxxx>; Date: Mon, 18 Jul 2005 13:33:07 +0200 (METDST); Is PI needed? If you use a mutex to protect a critical area you are destroying the strict meaning of priorities if the mutex doesn't have PI: Priority inversion can effectively make the high priority; /archives/xfs/2005-07/msg00248.html (12,051 bytes)
27. Re: RT and XFS (score: 1): Author: Esben Nielsen <simlo@xxxxxxxxxx>; Date: Mon, 18 Jul 2005 14:10:31 +0200 (METDST); As a matter of fact I just finished what corresponds to your "CS 101" (I study CS in spare time while having a full time job coding RT stuff): To the one lecture I attended they talked about sempahor; /archives/xfs/2005-07/msg00249.html (11,130 bytes)
28. Re: RT and XFS (score: 1): Author: "Richard B. Johnson" <linux-os@xxxxxxxxxxxx>; Date: Mon, 18 Jul 2005 08:17:19 -0400 (EDT); On Mon, 18 Jul 2005, Esben Nielsen wrote: On Thu, 14 Jul 2005, Christoph Hellwig wrote: On Thu, Jul 14, 2005 at 08:56:58AM -0700, Daniel Walker wrote: This reminds me of Documentation/stable_api_nons; /archives/xfs/2005-07/msg00250.html (12,484 bytes)
29. Re: RT and XFS (score: 1): Author: Bill Huey (hui) <bhuey@xxxxxxxx>; Date: Mon, 18 Jul 2005 20:31:32 -0700; It depends on what kind of PI under specific circumstances. In the general kernel, it's really to be avoided at all costs since it's masking a general contention problem at those places. In a formall; /archives/xfs/2005-07/msg00256.html (10,167 bytes)
30. Re: RT and XFS (score: 1): Author: Bill Huey (hui) <bhuey@xxxxxxxx>; Date: Mon, 18 Jul 2005 20:26:24 -0700; This is where you failed. You assumed that that person making the comment, Christopher, in the first place didn't have his head up his ass in the first place and was open to your end of the discussio; /archives/xfs/2005-07/msg00257.html (9,521 bytes)
31. Re: RT and XFS (score: 1): Author: Christoph Hellwig <hch@xxxxxxxxxxxxx>; Date: Tue, 19 Jul 2005 14:27:50 +0100; Actually having a mutex_t in mainline would be a good idea even without preempt rt, to document better what kind of locking we expect.; /archives/xfs/2005-07/msg00258.html (10,721 bytes)
32. Re: RT and XFS (score: 1): Author: Ingo Molnar <mingo@xxxxxxx>; Date: Tue, 19 Jul 2005 15:50:56 +0200; cool! I'll cook up a patch for that. Right now these are the numbers: there are 526 uses of struct semaphore in 2.6.12. In the -RT tree i had to change 23 of them to be compat_semaphore - i.e. 23 use; /archives/xfs/2005-07/msg00259.html (10,731 bytes)

Current List: 21 - 32
Page: [1] [2]