Proposed Affinity Changes

[Sebastian Huber]

On 2014-05-19 18:31, Joel Sherrill wrote:
>> Which algorithm do you use to calculate the subset of ready threads allowed to
>> >execute taking all the affinity sets into account?  I think you have to solve a
>> >matching problem in a bipartite graph:
>> >
>> >http://www.rtems.org/wiki/index.php?title=SMP#Theory
> I was actually planning to implement something more like Linux Push/Pull.
> It is very easy to create scenarios with inversions with arbitrary affinity
> sets.  But does a real-time embedded system which is supposed to be
> highly analyzed really have to deal with arbitrary overlapping affinities?

Ok, so you plan to add a scheduler that supports arbitrary thread processor 
affinities and this scheduler will assign a processor to the highest priority 
threads provided the affinity sets of all threads are well chosen

-- 
Sebastian Huber, embedded brains GmbH

Address : Dornierstr. 4, D-82178 Puchheim, Germany
Phone   : +49 89 189 47 41-16
Fax     : +49 89 189 47 41-09
E-Mail  : sebastian.huber at embedded-brains.de
PGP     : Public key available on request.

Diese Nachricht ist keine geschäftliche Mitteilung im Sinne des EHUG.