Finally, preemption wasn't possible in the earlier scheduler; this meant that a lower priority task could execute while a higher priority task waited for it to complete.
最后，在早期的内核中，抢占是不可能的；这意味着如果有一个低优先级的任务在执行，高优先级的任务只能等待它完成。
The red-black tree is O(log n) in time for most operations, while the previous scheduler employed O(1), using a priority array with a fixed number of priorities.
对于大多数操作，红黑树的执行时间为O(logn)，而以前的调度程序通过具有固定优先级的优先级数组使用 O(1)。
To prevent tasks from hogging the CPU and thus starving other tasks that need CPU access, the Linux 2.6 scheduler can dynamically alter a task's priority.
为了防止任务独占cpu从而会饿死其他需要访问CPU的任务，Linux 2.6版本的调度器可以动态修改任务的优先级。
Tuning scheduler algorithm using schedo to fine tune priority formulas — You can tune various parameters in AIX using schedo.
使用schedo调整调度程序算法，从而优化优先级公式——可以使用schedo调整AIX中的各种参数。
RSDL USES priority queues like the vanilla scheduler, while CFS does not.
RSDL使用诸如vanilla调度程序这样的优先级队列，而CFS没有使用。
The thread scheduler must dispatch from the head of the highest-priority queue that is not empty.
线程调度程序必须从非空的最高优先级队列的头部开始调度。
The job of the scheduler is simple: choose the task on the highest priority list to execute.
调度器的工作非常简单：它在优先级最高的队列中选择一个任务来执行。
Load balancing: the scheduler will decrease the priority of any process that generates more load than the processor can handle.
负载平衡：调度器会降低那些超出处理器负载能力的进程的优先级。
The scheduler USES two priority arrays, namely active and expired arrays, that are accessed through Pointers.
调度器使用了两个优先级数组，即活动数组和过期数组，可以通过指针来访问它们。
With the RTSJ, true priorities and a fixed-priority preemptive scheduler with priority-inheritance support is required for RT threads.
在RTSJ 规范中，RT线程需要真正的优先级，以及具有优先级继承支持的固定优先级抢占式调度程序。
In the original Cisco priority queueing feature, which USES the priority-group and priority-list commands, the scheduler always serviced the highest priority queue first.
在原先的Cisco优先级队列特性中，使用priority- group和priority - list命令，排队调度程序总是先处理最高优先级的队列。
CFS does not use a priority array, and it does away with the array-switching artifact of the vanilla scheduler. A few important differences between RSDL and CFS.
CFS没有使用优先级数组，它去掉了vanilla调度程序的数组切换工件。
A scheduling algorithm of the scheduler, namely fuzzy maximum first (FMF), can schedule dynamically the priority of network message.
该调度器采用模糊最大优先调度算法对网络消息发送的优先级进行动态调整。
This is the highest priority runnable task on the system and is the task the scheduler will run.
这就是系统中优先级最高的可执行进程，也是马上会被调度执行的进程。
When there are no more runnable threads at a given priority, the scheduler moves to the next lower priority and schedules the threads at that priority for execution.
如果在给定的优先级上不再有可运行的线程，则计划程序将移到下一个较低的优先级并在该优先级上调度线程以执行。
Task scheduler adopts the strategy of fixed-priority preemption to improve the real-time performance, and it can schedule 16 tasks at one time.
任务调度模块采用静态优先级抢占调度机制来提高实时性能，能同时调度16个任务。
Task scheduler adopts the strategy of fixed-priority preemption to improve the real-time performance, and it can schedule 16 tasks at one time.
任务调度模块采用静态优先级抢占调度机制来提高实时性能，能同时调度16个任务。
应用推荐