Lines Matching full:threads

6 The kernel's priority-based scheduler allows an application's threads
39 to be the current thread. When multiple ready threads of the same priority
44 (:kconfig:option:`CONFIG_SCHED_DEADLINE`) and a choice of threads have equal
47 enabled, two threads are only considered to have the same priority when both
55     cooperative threads and preemptive threads.
60 runtime overhead and performance scaling when many threads are added.
65   very fast constant time performance for single threads and very low code size.
67   that will never see more than a small number (3, maybe) of runnable threads in
77   quickly into the many thousands of threads.
79   Use this for applications needing many concurrent runnable threads (> 20 or
94   need to sort threads more finely, and SMP affinity which need to traverse the
95   list of threads.
97   Typical applications with small numbers of runnable threads probably want the
101 The wait_q abstraction used in IPC primitives to pend threads for later wakeup
108   this if you expect to have many threads waiting on individual primitives.
118   Choose this if you expect to have only a few threads blocked on any single
127 it may cause an unacceptable delay in the scheduling of other threads,
135 the CPU from time to time to permit other threads to execute.
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
146   time period. Ready threads of *all* priorities are then allowed to execute;
147   however, there is no guarantee that threads whose priority is lower
158 it may cause an unacceptable delay in the scheduling of other threads,
167 can be used to allow other threads of the same priority to execute.
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
183 Threads with a priority higher than specified limit are exempt from preemptive
186 only when dealing with lower priority threads that are less time-sensitive.
190    of equal-priority threads receive an equitable amount of CPU time,
201 other threads from interfering while the critical operation is being performed.
208 and allow other threads to execute. When the locking thread again
223 the CPU is relinquished to allow other ready threads to execute.
230 that something has occurred *without* requiring the threads
250 Use cooperative threads for device drivers and other performance-critical work.
252 Use cooperative threads to implement mutually exclusion without the need
255 Use preemptive threads to give priority to time-sensitive processing