priority queue
基本解釋
- [計(jì)] 優(yōu)先排隊(duì)
英漢例句
- The thread scheduler must dispatch from the head of the highest-priority queue that is not empty.
線程調(diào)度程序必須從非空的最高優(yōu)先級(jí)隊(duì)列的頭部開(kāi)始調(diào)度。 - 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.
釋放鎖以后,系統(tǒng)從爭(zhēng)用者的最高優(yōu)先級(jí)隊(duì)列的前端選擇線程,以便試圖鎖定對(duì)象。 - Internally, the priority queue uses a token bucket that measures the offered load and ensures that the traffic stream conforms to the configured rate.
這里,優(yōu)先級(jí)隊(duì)列采用令牌桶來(lái)調(diào)節(jié)提供的負(fù)載并且保證流量符合配置的速率。
blog.sina.com.cn
雙語(yǔ)例句
詞組短語(yǔ)
- high priority record queue 高優(yōu)先記錄隊(duì)列;高優(yōu)先級(jí)記錄隊(duì)列
- Priority Blocking Queue 優(yōu)先阻塞隊(duì)列
- priority y queue 優(yōu)先排隊(duì)
- low priority ready queue [計(jì)]低優(yōu)先級(jí)就緒隊(duì)列;翻譯
- high -priority record queue 高優(yōu)先級(jí)記錄隊(duì)列;高優(yōu)先權(quán)記錄隊(duì)列
短語(yǔ)
專業(yè)釋義
- 優(yōu)先級(jí)隊(duì)列
The advance in shortest path research is discussed. The implementation of Dijkstra algorithm by adopting binary heap priority queue is presented.
介紹了目前常規(guī)網(wǎng)絡(luò)分析內(nèi)容及求解方法,論述了最短路徑算法的研究進(jìn)展,提出了基于二叉堆優(yōu)先級(jí)隊(duì)列的Dijkstra算法;描述了遺傳算法這一目前流行的優(yōu)化技術(shù),介紹了遺傳算法在地理信息系統(tǒng)網(wǎng)絡(luò)分析方面的應(yīng)用。 - 優(yōu)先隊(duì)列
- 優(yōu)先級(jí)排隊(duì)
- 優(yōu)先列表
- 優(yōu)先佇列
- 優(yōu)先排隊(duì)
- 優(yōu)先隊(duì)列