From c5831a3f9af11228dbdaabaf01f69d37e55684ef Mon Sep 17 00:00:00 2001 From: Sebastian Huber Date: Wed, 9 Apr 2014 15:07:54 +0200 Subject: 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. --- testsuites/smptests/smpfatal06/smpfatal06.doc | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 testsuites/smptests/smpfatal06/smpfatal06.doc (limited to 'testsuites/smptests/smpfatal06/smpfatal06.doc') diff --git a/testsuites/smptests/smpfatal06/smpfatal06.doc b/testsuites/smptests/smpfatal06/smpfatal06.doc new file mode 100644 index 0000000000..e35b3b0a8e --- /dev/null +++ b/testsuites/smptests/smpfatal06/smpfatal06.doc @@ -0,0 +1,11 @@ +This file describes the directives and concepts tested by this test set. + +test set name: smpfatal06 + +directives: + + - _SMP_Handler_initialize() + +concepts: + + - Ensure that a scheduler without processor leads to a fatal error. -- cgit v1.2.3