kernel: rename 'dumb' scheduler and simply call it 'simple'
Improve naming of the scheduler and call it what it is: simple. Using 'dumb' for the default scheduler algorithm in Zephyr is a bad idea. Signed-off-by: Anas Nashif <anas.nashif@intel.com>
This commit is contained in:
parent
ad431b3c1a
commit
f29ae72d79
21 changed files with 75 additions and 57 deletions
|
@ -2,7 +2,7 @@ CONFIG_TEST=y
|
|||
CONFIG_NUM_PREEMPT_PRIORITIES=8
|
||||
CONFIG_NUM_COOP_PRIORITIES=8
|
||||
|
||||
# Switch these between DUMB/SCALABLE (and SCHED_MULTIQ) to measure
|
||||
# Switch these between SIMPLE/SCALABLE (and SCHED_MULTIQ) to measure
|
||||
# different backends
|
||||
CONFIG_SCHED_DUMB=y
|
||||
CONFIG_WAITQ_DUMB=y
|
||||
CONFIG_SCHED_SIMPLE=y
|
||||
CONFIG_WAITQ_SIMPLE=y
|
||||
|
|
|
@ -169,7 +169,7 @@ int main(void)
|
|||
}
|
||||
|
||||
/* For reference, an unmodified HEAD on qemu_x86 with
|
||||
* !USERSPACE and SCHED_DUMB and using -icount
|
||||
* !USERSPACE and SCHED_SIMPLE and using -icount
|
||||
* shift=0,sleep=off,align=off, I get results of:
|
||||
*
|
||||
* unpend 132 ready 257 switch 278 pend 321 tot 988 (avg 900)
|
||||
|
|
|
@ -2,7 +2,7 @@ Scheduling Queue Measurements
|
|||
#############################
|
||||
|
||||
A Zephyr application developer may choose between three different scheduling
|
||||
algorithms: dumb, scalable and multiq. These different algorithms have
|
||||
algorithms: simple, scalable and multiq. These different algorithms have
|
||||
different performance characteristics that vary as the
|
||||
number of ready threads increases. This benchmark can be used to help
|
||||
determine which scheduling algorithm may best suit the developer's application.
|
||||
|
|
|
@ -239,7 +239,7 @@ int main(void)
|
|||
freq = timing_freq_get_mhz();
|
||||
|
||||
printk("Time Measurements for %s sched queues\n",
|
||||
IS_ENABLED(CONFIG_SCHED_DUMB) ? "dumb" :
|
||||
IS_ENABLED(CONFIG_SCHED_SIMPLE) ? "simple" :
|
||||
IS_ENABLED(CONFIG_SCHED_SCALABLE) ? "scalable" : "multiq");
|
||||
printk("Timing results: Clock frequency: %u MHz\n", freq);
|
||||
|
||||
|
|
|
@ -21,9 +21,9 @@ common:
|
|||
- CONFIG_BENCHMARK_RECORDING=y
|
||||
|
||||
tests:
|
||||
benchmark.sched_queues.dumb:
|
||||
benchmark.sched_queues.simple:
|
||||
extra_configs:
|
||||
- CONFIG_SCHED_DUMB=y
|
||||
- CONFIG_SCHED_SIMPLE=y
|
||||
|
||||
benchmark.sched_queues.scalable:
|
||||
extra_configs:
|
||||
|
|
|
@ -2,7 +2,7 @@ Wait Queue Measurements
|
|||
#######################
|
||||
|
||||
A Zehpyr application developer may choose between two different wait queue
|
||||
implementations: dumb and scalable. These two queue implementations perform
|
||||
implementations: simple and scalable. These two queue implementations perform
|
||||
differently under different loads. This benchmark can be used to showcase how
|
||||
the performance of these two implementations vary under varying conditions.
|
||||
|
||||
|
|
|
@ -228,7 +228,7 @@ int main(void)
|
|||
freq = timing_freq_get_mhz();
|
||||
|
||||
printk("Time Measurements for %s wait queues\n",
|
||||
IS_ENABLED(CONFIG_WAITQ_DUMB) ? "dumb" : "scalable");
|
||||
IS_ENABLED(CONFIG_WAITQ_SIMPLE) ? "simple" : "scalable");
|
||||
printk("Timing results: Clock frequency: %u MHz\n", freq);
|
||||
|
||||
z_waitq_init(&wait_q);
|
||||
|
|
|
@ -20,9 +20,9 @@ common:
|
|||
- CONFIG_BENCHMARK_RECORDING=y
|
||||
|
||||
tests:
|
||||
benchmark.wait_queues.dumb:
|
||||
benchmark.wait_queues.simple:
|
||||
extra_configs:
|
||||
- CONFIG_WAITQ_DUMB=y
|
||||
- CONFIG_WAITQ_SIMPLE=y
|
||||
|
||||
benchmark.wait_queues.scalable:
|
||||
extra_configs:
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue