The thread scheduler must dispatch from the head of the highest-priority queue that is not empty.
线程调度程序必须从非空的最高优先级队列的头部开始调度。
In a serious program this priority queue might be based on a heap, as described in Chapter 12, "Heaps."
在正式的程序中，优先级队列可能基于堆来实现，正如第12章“堆”所描述的。
This necessitates looking through the priority queue item by item, to see if there's such a duplicate edge.
这使得在优先级队列中逐项查找成为必要的一步操作。
First of all, congestion index of priority queue is explicitly defined based on the analysis of dynamic flow-awareness.
在对动态流感知进行分析的基础上，定义了优先队列的拥塞指数。
Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
Similarly, when a notify() is done, the thread from the front of the highest-priority queue of waiters is unblocked from its wait.
类似地，完成notify() 以后，等待者的最高优先级队列前端的线程从等待中解除阻塞。
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.
这样做了以后，要使优先级队列中在任意时刻只保持一条从树中顶点到某边缘点的边就变得容易了。
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.
您可以在一行代码中使用这个gem清除所有任务和实现优先级队列，这样您的重要任务就不需要在例程作业后等待了。
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.
释放锁以后，系统从争用者的最高优先级队列的前端选择线程，以便试图锁定对象。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
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.
在程序的算法中，也要确保优先级队列中不能有连接已在树中的顶点的边。
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命令，排队调度程序总是先处理最高优先级的队列。
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.
锁释放或锁notify操作与调度分派操作类似，因为都是对最高优先级队列头部的线程起作用。
This paper designs an active network framework to support traditional IP application and implements a prototype. The paper implements a priority queue running in the prototype.
该文设计了支持传统IP应用的主动网络框架，进行了原型实现。
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.
为了解决好计算机网络中的多媒体通信以及对服务质量的要求，提出了一种基于优先级队列的缓存管理机制。
All fixed priority threads will be placed on the run queue if you change the default from 0 to 1.
如果您将缺省值从0更改为1，那么所有固定优先级的线程都将放入到这个运行队列中。
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.
每个服务区域将具有运行于其中的mdb实例，并基于消息优先级类型处理(使用)来自mq队列的消息。
Each CPU on a system has its own dedicated run queue, which is a list of runnable threads sorted by thread priority value.
系统上的每个CPU都有自己专用的运行队列，该队列是按线程优先级值排序的可运行线程的列表。
When using the message queue framework in your applications, you should define message priority and message expiration policies to conform to your specific requirements.
在应用程序中使用消息队列框架时，需要定义消息优先级和消息过期策略来满足特定的需求。
A run queue is a list of runnable threads, sorted by thread priority value.
运行队列是由运行线程所组成的列表，按照线程优先级的值进行排序。
A thread with an RT priority that voluntarily yields is placed at the back of the queue for its priority.
具有RT优先级并自愿让步的线程的优先级被置于队列的后端。
DelayQueue: a time-based scheduling queue backed by a priority heap.
DelayQueue：一个由优先级堆支持的、基于时间的调度队列。
Specifically, the indexer creates an indexing Job with a priority of Job.LONG and adds it to the platform's queue.
特别地，该索引器创建了一个带job . LONG优先级的索引job，并将其添加到平台的队列中。
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.
当一个执行线程超过它的时间量时，它的优先级被放在运行队列的后端并给它指定了新的时间量。
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.
这两个方法演示了一个场景：将五个消息输入到消息队列，然后取出并处理具有最高优先级的消息。
A thread is dispatched from the front of the nonempty run-queue with the highest priority.
一个从非空运行队列的前端分派的线程具有最高的优先级。
One of his prototype systems shuffles the queue of voice-mail messages to give priority to messages from friends when the phone is out of the office.
其中一个原型系统能自动调整语音邮件的优先级，如当用户不在办公室时手机将自动把朋友的语音邮件设置为优先接收。
One of his prototype systems shuffles the queue of voice-mail messages to give priority to messages from friends when the phone is out of the office.
其中一个原型系统能自动调整语音邮件的优先级，如当用户不在办公室时手机将自动把朋友的语音邮件设置为优先接收。
应用推荐