在对动态流感知进行分析的基础上，定义了优先队列的拥塞指数。
First of all, congestion index of priority queue is explicitly defined based on the analysis of dynamic flow-awareness.
借助随机服务系统理论，探讨带有优先队列逻辑环随机模型的状态转移有关问题。
Based on the theory of stochastic service system, this paper discusses state transition of logic ring stochastic model with priority queues.
线程调度程序必须从非空的最高优先级队列的头部开始调度。
The thread scheduler must dispatch from the head of the highest-priority queue that is not empty.
释放锁以后，系统从争用者的最高优先级队列的前端选择线程，以便试图锁定对象。
When a lock is released, the system chooses the thread from the front of the highest-priority queue of contenders to try to lock the object.
RTSJ的原理是所有的线程队列都是FIFO并且是基于优先级的。
The spirit of the RTSJ is that all queues of threads are FIFO and priority based.
因为线程执行的是相同的代码，所以它们应作出类似的动态优先级调整并在相同的运行队列中轮替执行。
Because the threads execute identical code, they should have similar dynamic priority adjustments and execute in a round-robin fashion from the same run-queues.
一个从非空运行队列的前端分派的线程具有最高的优先级。
A thread is dispatched from the front of the nonempty run-queue with the highest priority.
调度器的工作非常简单：它在优先级最高的队列中选择一个任务来执行。
The job of the scheduler is simple: choose the task on the highest priority list to execute.
基于优先级的FIFO行为——在前面的同步示例中，将接着执行具有最高优先级的线程——也适用于锁争用者和锁等待者的队列。
Priority-based FIFO behavior — as in the earlier synchronization example where the highest-priority thread is chosen to execute next — also applies to the queues of lock contenders and lock waiters.
在极端情况下，低优先级队列几乎不会处理并且本配不到一点带宽。
In extreme cases, the lower priority queues rarely were serviced and effectively were starved of bandwidth.
在发生拥塞期间，优先级队列不能使用任何超额的带宽。
During congestion conditions, a priority class cannot use any excess bandwidth.
通过从队列的前端分派线程和在队列的后端放置过期的线程，程序在一个优先级中轮替执行。
By dispatching from a queue's head and placing expired threads at a queue's tail, execution happens in a round-robin fashion within a priority.
具有RT优先级并自愿让步的线程的优先级被置于队列的后端。
A thread with an RT priority that voluntarily yields is placed at the back of the queue for its priority.
类似地，完成notify() 以后，等待者的最高优先级队列前端的线程从等待中解除阻塞。
Similarly, when a notify() is done, the thread from the front of the highest-priority queue of waiters is unblocked from its wait.
锁释放或锁notify操作与调度分派操作类似，因为都是对最高优先级队列头部的线程起作用。
A lock release or lock notify operation is analogous to a scheduling dispatch operation in the sense that the thread at the head of the highest-priority queue is acted on.
使用下面的命令创建一个优先级队列
您可以在一行代码中使用这个gem清除所有任务和实现优先级队列，这样您的重要任务就不需要在例程作业后等待了。
This gem lets you fire off jobs in one line of code and implements a priority queue so that your important jobs don't wait behind routine jobs.
在原先的Cisco优先级队列特性中，使用priority- group和priority - list命令，排队调度程序总是先处理最高优先级的队列。
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.
RSDL使用诸如vanilla调度程序这样的优先级队列，而CFS没有使用。
RSDL USES priority queues like the vanilla scheduler, while CFS does not.
如果您将缺省值从0更改为1，那么所有固定优先级的线程都将放入到这个运行队列中。
All fixed priority threads will be placed on the run queue if you change the default from 0 to 1.
系统上的每个CPU都有自己专用的运行队列，该队列是按线程优先级值排序的可运行线程的列表。
Each CPU on a system has its own dedicated run queue, which is a list of runnable threads sorted by thread priority value.
每个服务区域将具有运行于其中的mdb实例，并基于消息优先级类型处理(使用)来自mq队列的消息。
Each servant region will have instances of the MDBs running within it and process (consume) messages from the MQ queue based on the messages priority type.
在应用程序中使用消息队列框架时，需要定义消息优先级和消息过期策略来满足特定的需求。
When using the message queue framework in your applications, you should define message priority and message expiration policies to conform to your specific requirements.
当发生锁争用时，在内核空间中进行优先级提高和同步队列管理。
When lock contention occurs, priority boosting and synchronization-queue management is done in kernel space.
相反，应该考虑创建少数几个调度优先级高的写线程，把应该确保添加到队列中的数据交给这些线程。
Instead, consider creating a few writer threads with higher scheduling priorities, and hand over data to those threads that should always be pushed into the queue.
这两个方法演示了一个场景：将五个消息输入到消息队列，然后取出并处理具有最高优先级的消息。
The two methods demonstrate a scenario in which five messages are input to a message queue and the one with the highest priority is taken out of the queue and processed.
当一个执行线程超过它的时间量时，它的优先级被放在运行队列的后端并给它指定了新的时间量。
When an executing thread expires its time quantum, it's placed at the end of the run-queue for its priority and assigned a new time quantum.
在本例中，实现隔离的方法是：向单独的使用者分配单独的队列，并确保服务提供商按照优先顺序服务所有队列。
Here, isolation can be achieved by assigning separate queues to separate consumers, and ensuring that the service provider serves all queues in a prioritized manner.
在本例中，实现隔离的方法是：向单独的使用者分配单独的队列，并确保服务提供商按照优先顺序服务所有队列。
Here, isolation can be achieved by assigning separate queues to separate consumers, and ensuring that the service provider serves all queues in a prioritized manner.
应用推荐