Lines Matching refs:ready

21 - transition of a thread to the :ref:`ready state <thread_states>`, for
38 The kernel's scheduler selects the highest priority ready thread
39 to be the current thread. When multiple ready threads of the same priority
58 The kernel can be built with one of several choices for the ready queue
62 * Simple linked-list ready queue (:kconfig:option:`CONFIG_SCHED_DUMB`)
64   The scheduler ready queue will be implemented as a simple unordered list, with
71 * Red/black tree ready queue (:kconfig:option:`CONFIG_SCHED_SCALABLE`)
73   The scheduler ready queue will be implemented as a red/black tree.  This has
80   so).  Most applications won't need this ready queue implementation.
82 * Traditional multi-queue ready queue (:kconfig:option:`CONFIG_SCHED_MULTIQ`)
84   When selected, the scheduler ready queue will be implemented as the
139   prioritized list of ready threads, and then invokes the scheduler.
140   All ready threads whose priority is higher or equal to that of the
142   rescheduled. If no such ready threads exist, the scheduler immediately
149   the sleeping thread becomes ready once again.
155 the current thread until a higher priority thread becomes ready,
178 on behalf of the thread. This gives other ready threads of the same priority
180 If no threads of equal priority are ready, the current thread remains
223 the CPU is relinquished to allow other ready threads to execute.
224 Once the specified delay has elapsed the thread becomes ready
241 *without* relinquishing the CPU to another ready thread.