4.115
|
Last change
on this file since c5831a3f was
c5831a3f,
checked in by Sebastian Huber <sebastian.huber@…>, on 04/09/14 at 13:07:54
|
|
score: Add clustered/partitioned scheduling
Clustered/partitioned scheduling helps to control the worst-case
latencies in the system. The goal is to reduce the amount of shared
state in the system and thus prevention of lock contention. Modern
multi-processor systems tend to have several layers of data and
instruction caches. With clustered/partitioned scheduling it is
possible to honour the cache topology of a system and thus avoid
expensive cache synchronization traffic.
We have clustered scheduling in case the set of processors of a system
is partitioned into non-empty pairwise-disjoint subsets. These subsets
are called clusters. Clusters with a cardinality of one are partitions.
Each cluster is owned by exactly one scheduler instance.
|
-
Property mode set to
100644
|
|
File size:
55 bytes
|
| Line | |
|---|
| 1 | *** TEST SMPFATAL 7 *** |
|---|
| 2 | *** END OF TEST SMPFATAL 7 *** |
|---|
Note: See
TracBrowser
for help on using the repository browser.
![[RTEMS Logo]](/images/logo.png){kind=logo}
