RSDL USES priority queues like the vanilla scheduler, while CFS does not.
RSDL使用诸如vanilla调度程序这样的优先级队列，而CFS没有使用。
In extreme cases, the lower priority queues rarely were serviced and effectively were starved of bandwidth.
在极端情况下，低优先级队列几乎不会处理并且本配不到一点带宽。
This article describes aspects of RTSJ threading and synchronization by discussing how thread priorities and priority queues are managed.
本文通过讨论如何管理线程优先级和优先级序列来描述RTSJ线程化和同步。
Based on the theory of stochastic service system, this paper discusses state transition of logic ring stochastic model with priority queues.
借助随机服务系统理论，探讨带有优先队列逻辑环随机模型的状态转移有关问题。
Based on the queuing mechanism of the priority queues, a realization scheme for" self- recommendation" of the random service system was advanced.
论述了对红外亚成像目标识别随机服务系统建立的有优先权服务的等待制排队系统模型。
The spirit of the RTSJ is that all queues of threads are FIFO and priority based.
RTSJ的原理是所有的线程队列都是FIFO并且是基于优先级的。
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.
因为线程执行的是相同的代码，所以它们应作出类似的动态优先级调整并在相同的运行队列中轮替执行。
In other words, message queues can sort queued messages according to their individual priority.
换句话说，消息队列可以按照消息各自的优先级对已加入队列的消息进行排序。
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.
基于优先级的FIFO行为——在前面的同步示例中，将接着执行具有最高优先级的线程——也适用于锁争用者和锁等待者的队列。
First, this paper studies multiple servers queues with impatient customers of preemptive priority.
本课题首先研究了具有强占优先权、多个服务台的不耐烦排队模型。
It changes assignment priority by data items' average lengths or number of queues, and analyzes their performance.
根据数据项平均长度或数量改变分配优先级，对不同方案进行性能分析。
The different queues define packet priorities base on packet type, in order to give transmission priority to certain types of packets over other types of packets.
这些不同的队列基于分组类型定义分组优先级，以给予某些类型的分组以比其他类型的分组高的传输优先级。
The packet of same application class come into the same queue, and then are divided into different logical sub-queues by packet priority in the queue.
相同类型应用的数据包进入同一队列，在队列内部按分组的优先级分成不同的逻辑子队列。
The process of assigning packets to one of multiple queues, based on classification, for priority treatment through the network is called scheduling.
指派数据包到多个序列之一的过程，基于类别，对于通过网络的优先级处理叫做调度。
In this paper, a class cyclic service system is studied. In the system, there are mulitistations and two queues in each station. The service is a batch according to the priority of each queue.
本文讨论了多个工作站、每站有两个队列排队等待服务的循环移动服务系统，其服务规则是按照每个队列的化先权进行批量服务的。
In this paper, a class cyclic service system is studied. In the system, there are mulitistations and two queues in each station. The service is a batch according to the priority of each queue.
本文讨论了多个工作站、每站有两个队列排队等待服务的循环移动服务系统，其服务规则是按照每个队列的化先权进行批量服务的。
应用推荐