調度排隊 的英文怎麼說

中文拼音 [diàodùbèiduì]
調度排隊 英文
dispatcher queue
  • 調 : Ⅰ動詞1 （配合得均勻合適） harmonize; suit well; fit in perfectly 2 （使配合得均勻合適） mix; adju...
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 排 : 排構詞成分。
  • 隊 : Ⅰ名詞1 （人排成的行列） a row of people; line 2 （具有某種性質的集體） team; group 3 （特指少年先...
  • 調度 : 1 （調遣） dispatch （trains buses etc ） 2 （調度員） dispatcher 3 （安排） manage; control 4 （...
  • 排隊 : 1. （順次排列成行） form a line; line up; queue up 2. （歸類排列） classify; list
  1. Secondly the paper describes mathematically the steady index for container terminals based on the theory of queue networks and then deals with the events of the queue models of vessel arriving and leaving in this disperse system using the event scheduling method

    其次，論文以排隊網路理論，對集裝箱碼頭的一些穩態指標作了數學描述，最後利用事件調度法對集裝箱碼頭這一離散系統的船舶到、離港的排隊模型進行事件處理。
  2. Finding a feasible and efficient load balanced strategy for the ultra - scalable multi - plane multi - stage switch architecture is a top of nowadays research. the dissertation proposes a two - stage load balanced scheme for the ultra - scalable multi - plane multi - stage switch architecture based self - routing and non - blocking permutation benes network. the approach uses reasonable and efficient logical queueing strategy and schedule scheme in ingress traffic managers and switch planes to realize the two - stage load balancing of ip traffic which for different destination addresses

    本文提出一種適用於基於完全可重排無阻塞benes拓撲構建的多平面多路徑（多級）超大容量交換結構的兩級負載均衡策略，通過在輸入流量管理器和benes交換平面內部實施合理而高效的隊列組織調度方法，有效實現了基於不同目的地址的ip流量在兩個層次上的負載均衡，較好彌補了ciscocrs - 1系統在平面選擇和中間級選擇時所採用的簡單隨機或輪循方案的不足。
  3. With the setting of the peculiar conditions, we contribute the above system model for the first time to a kendall model, i. e. / l, : the size of buffer 1 / fcfs ( for same kinds of cells ) / l2 : the size of buffer 2 / non - prevail pr ( for different kinds of cells ) we resolved the model by " state transfer " method

    在設定工作環境及條件的基礎上，本論文首次為該系統模型建立了肯達爾排隊模型。即：並運用狀態轉移方法進行了解析。最後的模擬實驗數據表明優先級調度輸入?線群多通道輸出atm交換系統模型較好地改善了hol阻塞，提高了輸入排隊atm交換網路的性能。
  4. In this paper, i have established a appraisement index system after synthetically consideration affecting factor of trolleybus and bus in managing quality, determined right number of each index by grade analysis law, determined appraisement grade of each index by investigating to queue up, determined appraisement matrix by expert inquiry, calculated subordinating level which beijing ' s managing quality of trolleybus and bus in managing quality to each appraisement grade by " m (, ) " model algorithm in vague mathematics. according to identification principle, i have reached conclusion

    本論文在綜合考慮公共電汽車運營質量影響因素的前提下，確定了公共電汽車運營質量評價指標體系，採用層次分析法確定指標權數，通過調查排隊來確定各指標的評價等級，通過專家調查法確定評價矩陣，利用模糊數學中m （ ? ? ）模型演算法計算一個城市公共電汽車運營質量對「優、良、中、差」的隸屬度，根據識別原則，得出結論。
  5. This paper mainly analyzes control delay at urban signalized intersections. based on the survey data, this paper talks about vehicles movement characteristics of arrival and depart process, then the queueing headway distribution is obtained, and the suggestion that saturated flow should be measured from the sixth queuing vehicle is offered. using random process theory analysis and computer simulation, the queuing length distribution model is obtained

    本論文針對平面信號控制交叉口的延誤問題進行了分析，在實測數據分析的基礎上，探討了車輛到達過程和離開過程的運行特性，給出信號交叉口排隊離散車頭時距分佈模型，提出飽和流率的測量應從第六個離開的排隊車輛算起；運用隨機過程理論和計算機模擬的方法得到了信號交叉口排隊長度分佈模型，在此基礎上運用協調變換的方法改進了車輛延誤模型。
  6. Caused by the strict fifo service rule, hol cell block is the very disadvantage of the input - queued atm switches. to solve the problem, two things should be considered, that is the selection of scheduling strategy " and the decision of switch structure

    輸入排隊atm交換的最大問題是它的隊首（ hol ）阻塞，它是由於嚴格的fifo服務規則所引起的，在對該問題的解決上主要涉及兩個方面：調度策略的選擇和交換結構的確定。
  7. This text has analysed load balancing method of existent especially lvs cluster system and recommended the net packet and netfilter ’ s frame structures in the linux operating system ; it has compared the cooperative - type - cluster with tradictional cluster in the net packets ’ queue ways and with active cluster in the load balancing dispatcher way, which has reflected the superiority of cooperation type cluster ; the three major parts of the cooperative - type - cluster have been designed and realized in this text, which includes sync packets ’ priority service for dmcs 、 “ priority and avoid sudden load unbalance ” dispatch way at the cooperation of nodal servers and director and active nodal server which ensure cluster normally running when cluster join or rduce node server ; the cooperative - type - cluster ’ s control frame controlled by homepage has been constructed ; the mulit - services cluster system has been realized ; this text has used the existing server pressure testing tools to test the cooperative - type - cluster and lvs cluster, then has comparaed and analysed the two

    本文分析了現有服務器集群特別是lvs集群系統的負載均衡方法，介紹了linux系統下的報文和netfilter的框架結構;將所提出的合作式集群與傳統集群在報文排隊方式上進行比較，與主動式集群在負載均衡調度方式上進行比較，體現了合作式集群的優越性;設計並實現了合作式集群體系結構的三大部分:針對分散式測控系統的加權服務、負載均衡器與節點服務器合作式「加權防突」負載調度、保證集群運行不受加減節點干擾的主動性真實服務器;構建了通過網頁界面控制合作式集群的控制框架;實現了一個可運行的合作式多服務集群系統，運用現有服務器壓力測試工具對合作式集群和lvs集群進行負載測試，並對測試結果進行比較分析，同時通過壓力測試實現加權服務。
  8. This paper set up the model with the queue theory, the simulation policy of event scheduling and the method of flow chart

    本文借鑒排隊理論，採用了事件調度法的模擬策略，利用流程圖法建立港口拖輪作業過程的模擬模型。
  9. In the chapter 4, we make an extension to the model of the chapter - 2. the service speed change is instant, that is say, during the service using speed - 1 to serve, if the number exceeds the threshold n, then the server should immediately use speed - 2 not speed - 1 to serve current customer and the next till entered the empty state. we especially point out that the classical m / g / 1 queuing model and the m / g / 1 queuing with n - policy are the particular cases of model discussed in chapter - 4

    第四章對第二章討論的模型進行了進一步的擴展，其服務速度1到速度2的轉移規則是瞬間轉移，也即當服務臺以速度1服務顧客的過程中如發現系統中的顧客數已超過門限n值時就即刻調整為以速度2服務當前顧客和后續顧客直到系統變空的可修m g （ m g ） 1排隊系統，並指出經典的m g 1和具有n -策略的m g 1排隊是本章研究的兩種特例。
  10. First, a locating and ranking algorithm, based on theory of constraints ( toc ), is put forward. then, other methods aimed at different traffic measures of effectiveness are respectively advanced, which are the capacity method, delay method, speed method, investigation vehicle method, queue length method and density method respectively

    文章首先提出了基於約束理論（ toc ）的瓶頸定位與排序方法，然後針對具體的指標提出了通行能力法、延誤法、速度法、調查車法、車輛排隊長度法、密度法等六種方法。
  11. Hierarchical reinforcement learning scheduling ofopen re - entrant queueing network

    開環可重入排隊網路的遞階增強型學習調度
  12. Always configure the default scheduling plug - in first ; it orders all jobs in the queue based on their queuing time

    應該總是先配置默認的調度程序插件；該插件可根據排隊時間對所有的作業進行排序。
  13. Afterwards, the thesis goes deep into the study of the fair scheduling issue in manet, and then proposes a new fully distributed, simple yet effective queue backoff weighted fair scheduling algorithm, which can provide service differentiation of the traffic flows while achieving fair access to all mobile nodes

    然後，論文深入研究了manet的公平調度問題，並提出了一種全分散式且簡單有效的新型加權排隊退避公平演算法，在改善網路中各結點接入通道公平性的同時，可實現對不同服務等級要求業務的區分服務。
  14. The design of qos - aware web cluster system the analysis of the technology of qos and load balance based on large - scale web computing ; the design of this system which involves in two vital components : web cluster switch and web server cluster ; the design of load balance component and queue management component witch are the keys of web cluster switch ; the discussion on popular load balance algorithms, queue algorithms and queue scheduling algorithms ; the design of particular algorithm : qos - aware round robin scheduling. 3

    支持qos的web集群系統的設計詳細分析了基於大型web計算環境的服務保證與負載均衡的相關技術，設計出支持qos的web集群系統的兩層體系結構： web集群交換機和web服務器集群，並且設計了web集群交換機的核心組件：負載均衡器和隊列管理器，討論了目前流行的負載均衡演算法、排隊演算法和隊列調度演算法，並且設計了該系統獨特的演算法：支持qos的加權輪詢調度演算法。
  15. For the sake of allocating bandwidth fairer both in an environment mixed with unresponsive and responsive flows and in one full of tcp flows, friday ( fair random indication with discarding aggressiveness yardstick ) algorithm is presented and researched, combined with a fcfs and fq ( fair queueing ) scheduler, in chapter iv

    為了在響應流和非響應流混合的環境中，以及在tcp流為主的環境中，都能用某種緩存管理技術更公平地分配帶寬，本文在第四章提出friday （服從激進流丟棄準則的公平隨機指示）演算法，並將其與fcfs和fq （公平排隊）調度演算法結合研究。
  16. A study on modeling, scheduling and optimal control problems for a class of hybrid manufacturing systems is investigated. in this framework, the discrete entities have a state characterized by a temporal component whose evolution is described by event - driven dynamics and a physical component whose evolution is described by continuous time - driven dynamics, thus it is a typical hybrid system. not only the optimal control for manufacturing process like that discussed in many references but also the optimal machining sequence are considered in this paper. the whole problem is solved by a two - level optimization method : at the inner loop, for any given machining sequence of the jobs, the optimal control for manufacturing process is considered ; while at the outer level, an improved genetic algorithm is used to decide the optimal machining sequence of a batch of jobs to be processed. finally, some examples are given to illustrate the validity of the algorithm

    研究了一類單階段混合製造系統的建模、分析與調度問題，這類系統既包含離散事件動態，也包含連續時間動態，前者用排隊網路描述，後者用微分方程描述.不僅考慮了a這類系統的最優控制問題，而且考慮了工件進入生產線的最優時間，並用一個復雜的優化模型描述，同時給出了一個兩層優化方法，內層給出對給定工件序列的最優控制，而外層用一改進的遺傳演算法求解工件進入生產線的最優時間序列.若干模擬實例說明了演算法的有效性
  17. The simulation results show that guarantee capability for the drop and play - out outage ratio of the proposed scheme outperforms the modified - largest weighted delay first algorithm and exponent proportional fair algorithm, which only take the head - of - line delay into consideration

    模擬結果表明，提出的方法對于丟包率和中斷率的服務質量保證能力，均優于修正的最大加權時延優先演算法和指數正比公平演算法等僅以排隊時延為優化目標的混合業務調度演算法。
  18. The queuing service applies scheduling policies, which include matching job requirements to grid resource attributes

    排隊服務應用調度策略，將作業的需求和網格資源的屬性相匹配。
  19. In the internet, packet - dropping - based buffer mangement algorithm is an important module in a packet - forwarding device. by employing the buffer management algorithms, ( 1 ) tcp flows can be protected, ( 2 ) without per - flow queueing, the bandwidth of unresponsive and responsive flows can be balanced even with fcfs ( first - come - first - served ) scheduler, ( 3 ) based on per - flow queueing, the bandwidth of unresponsive and responsive flows, as well as that of pure responsive flows can be balanced at the same time, and ( 4 ) in a multi - priority network, different bandwidth can be allocated according to a predetermined proportion

    Internet中，基於分組丟棄技術的緩存管理演算法是分組轉發設備的一個重要的功能模塊，利用它， （ 1 ）可以保護tcp流， （ 2 ）可以在採用fcfs （先到先服務）調度演算法時較公平地分配響應流和非響應流的帶寬， （ 3 ）可以在按流排隊的基礎上同時較公平地分配響應流和非響應流、以及響應流之間的帶寬， （ 4 ）還可以在多優先級的網路環境中，根據預定的比例分配帶寬。
分享友人
分享到 Line

分享到臉書