priority queues 中文意思是什麼
priority queues
解釋
優先隊列-
One useful feature of message queues is that they enable associated applications to process messages according to priority
消息隊列的一種有用功能是，它們可以讓關聯的應用程序按優先級處理消息。 -
It stipulates that the service is non - preemptive, and the service has not decision time, that is to say that the server is not just idle only if the queues have customers, moreover the server serves these queues according to the priority
此規貝11規定服務臺服務是非搶先的，並且是不帶決策延遲的，即只要隊列有顧客，服務臺就不輪空，並按優先級高低對各隊列進行服務顯然此模型得到的結果是個理想值，不能應用於實際 -
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
提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果 -
Abstract : 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
文摘:提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果 -
Such queues are called priority queues ; in this type of queue service is not in order of time of arrival but rather in order of some measure of priority
這種隊列稱為優先級隊列；在這種隊列中，服務順序是按照事件優先級而非事件到達先後而定的。 -
Different applications will have different policies to define their message priority, so message queues need an interface that allows application developers to define and plug in their specific policies flexibly and dynamically
不同的應用程序具有定義其消息優先級的不同策略，因此消息隊列需要具有一個允許應用程序開發人員靈活、動態地定義並插入其特定策略的介面。 -
As grid machines become available to execute jobs, the jobs are taken from the highest priority queues first
當網格計算機可以執行任務的時候，就從優先級最高的隊列中取出第一個任務。 -
The base priority of private queues and of directly accessed public queues is always zero
專用隊列和直接訪問的公共隊列的基本優先級始終為零。 -
In dpcx, a forward - chained list of all threads added to a priority level since that level ' s scheduler last referred to its queues
在分散式處理控制執行程序（ dpcx ）中，自從一個優先級的調度程序最後一次查閱它的隊列以來所添加到這個優先級上的所有線程的一個正向鏈接表。 -
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將帶寬分配給各個優先級隊列。 -
This is sometimes done by using several job queues, each with a different priority
優先級的實現方式有時是使用多個任務隊列，其中每一個隊列都代表不同的優先級。 -
In computing, some of the most common organizations are linked lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, and graphs
在計算機技術中，一些最常用的組織方式是鏈接表、堆棧、隊列、集合、哈希表、樹、堆、優先隊列和圖。 -
Using the method of imbedded markov chain, probability generating funtion and laplace transform, we can obtain the mean queue length, mean waiting time for each queue and generalize this conclusion to multi - priority queues. this chapter includes four sections. in the first section, the detailed description of the system is given, and the set of stationary equations of the imbedded markov chain is obtained
第二章考慮的是一個三個隊輸入的帶優先權非搶先的m m 1系統，這是一個連續時間的排隊系統，採用嵌入馬爾可夫鏈的方法，以母函數和拉普拉斯變換為工具求出了三個隊的平均隊長和平均等待時間，並給出了此結論推廣到n個隊的根據和方法。 -
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
信息流量的每一類是被規定了優先等級，在鏈路擁擠或使用過度時，隊伍中優先權更高的排隊首先借用資源。
分享友人