Each CPU has a dedicated run queue.
每个CPU都有一个专门的运行队列。
This automatically places the thread on the global run queue.
这样一来，就会自动地将线程放入到全局运行队列中。
This results in the process getting moved off from the CPU run queue.
这样会将进程从CPU运行队列中移除。
There is also an additional global run queue where new threads are placed.
还有一个附加的全局运行队列，其中放的是新的线程。
A run queue is a list of runnable threads, sorted by thread priority value.
运行队列是由运行线程所组成的列表，按照线程优先级的值进行排序。
The run queue, which holds an ordered list of processes waiting to run, is another queue.
另一个队列是运行队列，其中包含等待运行的进程的有序列表。
TASK_RUNNING: the process is either running on CPU or waiting in a run queue to get scheduled.
TASK_RUNNING：进程当前正在运行，或者正在运行队列中等待调度。
All fixed priority threads will be placed on the run queue if you change the default from 0 to 1.
如果您将缺省值从0更改为1，那么所有固定优先级的线程都将放入到这个运行队列中。
When a CPU is ready to dispatch a thread, the global run queue is checked before any of the others.
当CPU准备分派线程时，它会先检查全局运行队列，然后再检查其他队列。
Each CPU on a system has its own dedicated run queue, which is a list of runnable threads sorted by thread priority value.
系统上的每个CPU都有自己专用的运行队列，该队列是按线程优先级值排序的可运行线程的列表。
The amount of threads in the run queue. These are threads that are runnable, but the CPU is not available to execute them.
当前运行队列中线程的数目。代表线程处于可运行状态，但CPU还未能执行。
In a system that is CPU-bound, all the processors are 100 percent busy and some jobs might be waiting for CPU time in the run queue.
在CPU受限的系统中，所有处理器都是100%忙碌的，并且一些作业可能正处在运行队列中等待CPU时间。
For each virtual processor, between 0.1 and 1.0 physical processor can be dispatched to execute tasks in that virtual processor's run queue.
对于每个虚拟处理器，可以分配0.1到1.0个物理处理器以执行虚拟处理器运行队列中的任务。
Also keep in mind that having too many page cleaners may overwhelm the run queue on the database server and cause the significant performance degradation.
还请记住，配置太多页面清洗器可能会损害数据库服务器上的运行队列，并导致极大的性能下降。
But rather than maintain the tasks in a run queue, as has been done in prior Linux schedulers, the CFS maintains a time-ordered red-black tree (see Figure 1).
但是与之前的Linux调度器不同，它没有将任务维护在运行队列中，CFS维护了一个以时间为顺序的红黑树(参见图1)。
Generally speaking, a system has an excellent chance of becoming CPU-bound if the CPU is 100 percent busy, has a large run queue compared to the number of CPUs, and more context switches than usual.
通常来说，如果某个系统的CPU是100%忙碌，并且相对于CPU的数目来说拥有大规模的运行队列，以及具有更为频繁的上下文切换，那么该系统很有可能成为CPU受限系统。
Logically, you can view the system as managing a single FIFO queue, termed a run-queue, for each of the 40 priorities.
逻辑上可将系统看作：为(40个中的)每个优先级管理一个fifo序列，称为运行队列。
A thread is dispatched from the front of the nonempty run-queue with the highest priority.
一个从非空运行队列的前端分派的线程具有最高的优先级。
A thread is dispatched from the front of the nonempty run-queue with the highest priority.
一个从非空运行队列的前端分派的线程具有最高的优先级。
应用推荐