Re: Real-Time Preemption and RCU

[Ingo Molnar <mingo@elte.hu>]

* Ingo Molnar <mingo@elte.hu> wrote:

> * Paul E. McKenney <paulmck@us.ibm.com> wrote:
> 
> > 4. Preemptible read side.
> > 
> > 	RCU read-side critical sections can (in theory, anyway) be quite
> > 	large, degrading realtime scheduling response.	Preemptible RCU
> > 	read-side critical sections avoid such degradation.  Manual
> > 	insertion of "preemption points" might be an alternative as well.
> > 	But I have no intention of trying to settle the long-running
> > 	argument between proponents of preemption and of preemption
> > 	points.  Not today, anyway!  ;-)
> 
> i'm cleverly sidestepping that argument by offering 4 preemption
> models in the -RT tree :-) We dont have to pick a winner, users will.
> [...]

also, it turned out that "preemption points" vs. "forced preemption" are
not exclusive concepts: PREEMPT_RT relies on _both_ of them.

when a highprio task tries to acquire a lock that another, lower-prio
task already holds, then 'the time it takes for the lowprio task to drop
the lock' directly depends on the frequency of explicit preemption
points within the critical section. So to get good 'lock dependent'
latencies on PREEMPT_RT we need both a good distribution of preemption
points (within locked sections).

(obviously, 'lock independent' preemption latencies purely depends on
the quality of forced preemption and the size of non-preempt critical
sections, not on any explicit preemption point.)

dont we love seemingly conflicting concepts that end up helping each
other? It's a nice flamewar-killer ;-)

	Ingo