使用下面的命令创建一个优先级队列
这会加快在较大的优先级队列中的操作。
线程调度程序必须从非空的最高优先级队列的头部开始调度。
The thread scheduler must dispatch from the head of the highest-priority queue that is not empty.
在发生拥塞期间，优先级队列不能使用任何超额的带宽。
During congestion conditions, a priority class cannot use any excess bandwidth.
这使得在优先级队列中逐项查找成为必要的一步操作。
This necessitates looking through the priority queue item by item, to see if there's such a duplicate edge.
在极端情况下，低优先级队列几乎不会处理并且本配不到一点带宽。
In extreme cases, the lower priority queues rarely were serviced and effectively were starved of bandwidth.
然而，在这种情况下，必须违反一下优先级队列的设计思想。
However, violating the spirit of the priority queue is necessary in this situation.
每次向树中添加顶点后，都要遍历优先级队列查找并删除这样的边。
We could go through the queue looking for and removing any such edges each time we added a new vertex to the tree.
也就是说，优先级队列中应该只包含一条到达某个第二类顶点的边。
That is, the queue should contain only one edge to each category 2 vertex.
释放锁以后，系统从争用者的最高优先级队列的前端选择线程，以便试图锁定对象。
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.
RSDL使用诸如vanilla调度程序这样的优先级队列，而CFS没有使用。
RSDL USES priority queues like the vanilla scheduler, while CFS does not.
在程序的算法中，也要确保优先级队列中不能有连接已在树中的顶点的边。
In a programming algorithm we must likewise make sure that we don't have any edges in the priority queue that lead to vertices that are already in the tree.
在正式的程序中，优先级队列可能基于堆来实现，正如第12章“堆”所描述的。
In a serious program this priority queue might be based on a heap, as described in Chapter 12, "Heaps."
类似地，完成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.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
这样做了以后，要使优先级队列中在任意时刻只保持一条从树中顶点到某边缘点的边就变得容易了。
As it turns out, it is easier to keep only one edge from the tree to a given fringe vertex in the priority queue at any given time.
为了解决好计算机网络中的多媒体通信以及对服务质量的要求，提出了一种基于优先级队列的缓存管理机制。
To meet the need of multimedia communications in network in desirable quality of service, a priority queue based on buffer management mechanism is forwarded in support of multimedia communications.
您可以在一行代码中使用这个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.
某个优先级队列的令牌如果不够用，允许向其他优先级队列借用令牌，或收回借出的令牌，从而实现带宽的动态分配。
If one queue's tokens are not enough, it can borrow some from other queues, or take back the ones it has lent out; this can realize dynamic bandwidth allocation.
在原先的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.
每个服务区域将具有运行于其中的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.
当一个执行线程超过它的时间量时，它的优先级被放在运行队列的后端并给它指定了新的时间量。
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.
运行队列是由运行线程所组成的列表，按照线程优先级的值进行排序。
A run queue is a list of runnable threads, sorted by thread priority value.
因为线程执行的是相同的代码，所以它们应作出类似的动态优先级调整并在相同的运行队列中轮替执行。
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.
RTSJ的原理是所有的线程队列都是FIFO并且是基于优先级的。
The spirit of the RTSJ is that all queues of threads are FIFO and priority based.
RTSJ的原理是所有的线程队列都是FIFO并且是基于优先级的。
The spirit of the RTSJ is that all queues of threads are FIFO and priority based.
应用推荐