您要查找的是不是：
- Adjustable real-time MAC protocol based on distributed dynamic priority queue 基于分布式动态优先权队列实时可调的MAC协议
- Dynamic priority queue 动态优先队列
- The method effective_prio() returns a task's dynamic priority. 函数可以返回一个进程的动态优先级。
- A priority queue is unbounded, but has an internal capacity governing the size of an array used to store the elements on the queue. 一个优先队列是极大的，但是拥有一个内部的容量调节数组的大小用来存储在队列中的元素。
- No-interrupted priority queue polling mechanism with exhaustive service is applied as a channel accession policy in the communication in this paper. 本通信系统采用了基于完全服务的非抢占排队优先权轮询机制作为信道共享策略。
- Binary heap data structure is used to fulfill the operation of priority queue,and the computational effi... 仿真试验结果表明该算法具有良好的性能。
- Say, for instance, that your scheduler checks the strict priority queue and there is nothing there. 譬如说，假设调度程序检查严格的优先级队列后，发现没有任何优先级队列。
- In a serious program this priority queue might be based on a heap, as described in Chapter 12, "Heaps. 在正式的程序中，优先级队列可能基于堆来实现，正如第12章“堆”所描述的。
- This example shows how to customise handler invocation. Completion handlers are added to a priority queue rather than executed immediately. 这个例子展示了如何自定义处理全程的调用.;完成例程被加入到一个优先队列而不是立即被执行
- In the algorithm, the priority queue concept and the rip-up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. 该算法采用优先队列同拆线重布策略相结合的方法，控制由互连线耦合电容引起的串扰噪声。
- A programming example of a priority queue is the scheduler of an operating system determining which, of a number of waiting processes, should execute next. 使用优先级队列的程序示例是操作系统的调试表，它决定在大量等待进程中下一个要执行的进程。
- Compared with First Come First Service (FCFS), Short Request First (SRF) and Dynamic Earliest Deadline First (DEDF) policy. The results show that the Dynamic Priority Scheduling Policy can enhance the Web QOS by increasing just a little response time. 将DPSP策略和先来先服务策略FCFS、短作业优先策略SRF及DEDF策略进行了比较，结果表明动态优先级调度策略可以在响应时间增量相对较小的同时显著提高WWW的服务质量。
- Starvation is a common limitation of simple priority queuing mechanisms. 简单的优先权排队机理的一个常见局限就是“饥饿”（即访问要求不能满足）。
- Application of Dynamic Priority in CAN Network 动态优先级思想在CAN总线网络中的应用
- Dynamic Priority Systems and Their Applications 动态优先系统及其应用
- Dynamic Priority Search Tree(DPST) 动态优先搜索树
- Priority Queue Based on K-Ary Tree 基于K叉树的优先队列
- Priority queue with flow control 带流量控制的优先权排队
- As grid machines become available to execute jobs, the jobs are taken from the highest priority queues first. 当网格计算机可以执行任务的时候,就从优先级最高的队列中取出第一个任务。
- Each class of traffic is prioritized, so the higher priority queues are first in line for borrowing resources during periods of link congestion or over subscription. 信息流量的每一类是被规定了优先等级，在链路拥挤或使用过度时，队伍中优先权更高的排队首先借用资源。
