Help¶

When selected, the scheduler ready queue will be implemented as a simple unordered list, with very fast constant time performance for single threads and very low code size. Choose this on systems with constrained code size that will never see more than a small number (3, maybe) of runnable threads in the queue at any given time. On most platforms (that are not otherwise using the red/black tree) this results in a savings of ~2k of code size.

Direct dependencies¶

(Includes any dependencies from if’s and menus.)

Kconfig definition¶

At kernel/Kconfig:203

Included via Kconfig:10 → Kconfig.zephyr:25

Menu path: (top menu) → General Kernel Options → Scheduler priority queue algorithm

config SCHED_DUMB
    bool
    prompt "Simple linked-list ready queue" if <choice SCHED_ALGORITHM: Scheduler priority queue algorithm>
    depends on <choice SCHED_ALGORITHM: Scheduler priority queue algorithm>
    help
      When selected, the scheduler ready queue will be implemented
      as a simple unordered list, with very fast constant time
      performance for single threads and very low code size.
      Choose this on systems with constrained code size that will
      never see more than a small number (3, maybe) of runnable
      threads in the queue at any given time.  On most platforms
      (that are not otherwise using the red/black tree) this
      results in a savings of ~2k of code size.

(Definitions include propagated dependencies, including from if’s and menus.)