In computing , some of the most common organizations are linked lists , stacks , queues , sets , hash tables , trees , heaps , priority queues , and graphs 在计算机技术中，一些最常用的组织方式是链接表、堆栈、队列、集合、哈希表、树、堆、优先队列和图。
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 信息流量的每一类是被规定了优先等级，在链路拥挤或使用过度时，队伍中优先权更高的排队首先借用资源。
The novel olt - based polling scheme has a fixed polling cycle ( 2ms ) . onu ’ s buffer receives different data packets from user , and these packets are classified and then placed into their corresponding appropriate priority queue 新算法采用olt端集中统筹控制并以固定周期2ms轮询各个onu , onu端主要控制分类缓存用户端来的不同类别业务流。
Since the technique that the priority queue service in the buffer and responding firstly high - priority certificate over others are adopted , the new scheme ensures certificate security , which is applied to important business effectively 同时，在缓存器的排队队列中实施优先权服务，将高优先权证书的crl请求优先响应，这对于保证高额交易证书安全性十分重要。
The third chapter deals with a non - absolute priority queueing system b / d / 1 with decision time and two priority . this is a discrete time system . also adopting the method of imbedded markov chain , we can obtain the mean queue length for each queue 采用嵌入马尔可夫链的方法，求出了两个队队长联合分布的母函数的解析表达式，并进而求出了两个队的平均队长。
Based on the analysis on the concurrent processing performance requirements of monitoring system , a priority queuing algorithm is proposed to realize the concurrent scheduling of vehicle monitoring system with the algorithm implementation scheme given 在对监控中心并发处理的性能要求进行分析的基础上，提出了优先数事件队列算法来实现车辆监控中心的并发调度机制，并给出了算法实现。
Then a new fixed cycle polling dynamic bandwidth allocation algorithm is proposed to support qos and improve bandwidth utilization in epon . the proposed algorithm consists of two parts : one is scheduling between olt and onus , and the other is scheduling between priority queues in onu 此算法将带宽分配过程分为两部分,首先是onu之间的调度,即olt给每个onu分配带宽;其次是onu内部的调度,即onu将带宽分配给各个优先级队列。
Based on no - preemptive priority queuing network model , new infinitesimal perturbation analysis schemes were presented to estimate the dynamic time performance of dms based on common ojbect request broker architecture ( corba ) and dimensional measurement interface standard ( dmis ) 针对基于公共对象请求代理结构和尺寸测量接口规范的分布式测量系统，根据多用户非抢占优先排队网络静态性能模型，提出基于无穷小摄动分析的分布式测量系统动态性能评价算法。
An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage . 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 . first , the nets are arranged into different priority queues according to their weighted sum of their length and criticality . then , the cpa problem for one queue of nets is translated into a linear assignment problem . after the assignment of one queue of nets , a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned . the algorithm is tested by a set of bench mark examples , and the experimental results are promising 提出了一种在过点分配阶段解决噪声耦合效应问题的算法.该算法采用优先队列同拆线重布策略相结合的方法,控制由互连线耦合电容引起的串扰噪声.算法中,首先按照线长和约束限制,将线网划分到若干个优先队列中.然后,将每个优先队列的过点分配问题转换为线性分配问题.在完成一个线网队列的分配后,通过过点分配后处理过程检查串扰约束满足情况,对违反约束的线网对进行拆除,放入后续线网队列进行重新分配.实验数据表明,该算法能够取得好的效果
This proposed algorithm consists of two parts : one is scheduling between olt and onu , and the other is scheduling between priority queues in onu . it is showed by simulation results that the algorithm ensures the qos of different services with higher priority and can improve bandwidth utilization , meet the requirement of epon system 此算法将带宽分配过程分为两部分,首先是光线路终端olt ( opticallineterminal )的优化调度,即olt对每个onu分配带宽,其次是onu内部的调度,即在onu内部设置优先级队列,根据业务的qos要求将不同业务的数据分配到各个优先级队列中。
