scheduling queue 中文意思是什麼

scheduling queue 解釋
調度隊列
  • scheduling : 編排；調度
  • queue : n 1 發辮，辮子。2 〈英國〉（順序等車、購物的）行列，長隊；車隊。vt 把（頭發）梳成辮子。vi 〈英國...
  1. Fsmail adopts and implements the asynchronous event driven mechanism, with all those network i / o operations in the server working under the non - blocking style ; accomplishes object - oriented heap with the dynamic array, adapted to any type of data ; adopts the multi - queue scheduling mechanism based on a fsm, easily to fulfill the extentions of delivery funtions ; fulfills the non - blocking domain name resolvement mechanism and the caching of the resolved results ; implements the non - blocking user database management and the caching of the user data recently accessed ; uses the unified memory pool management, avoiding the memory leakage and improving the performance of the fsmail server ; lastly, implements the log management server based on the c / s mode, eliminating the inconsistency of the logging metadata and being adapted to any kind of application logging

    Fsmail採用並實現了異步事件驅動機制，所有網路i o的實現使用了非阻塞方式；以動態數組實現了基於面向對象的堆隊列，屏蔽了堆數據的非一致性；使用了基於有限狀態機的多隊列郵件調度機制，為后續版本的擴展性提供了良好的介面機制；服務器內部實現了非阻塞的域名解析機制，並實現域名地址緩存；實現了非阻塞的用戶數據庫管理模塊，並實現用戶數據緩存；使用了統一的內存池管理機制，既防止了內存泄漏，又提高了服務器的性能；最後，還實現了基於c s模式的日誌管理服務器，屏蔽了日誌數據元的非一致性。
  2. 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

    其次，論文以排隊網路理論，對集裝箱碼頭的一些穩態指標作了數學描述，最後利用事件調度法對集裝箱碼頭這一離散系統的船舶到、離港的排隊模型進行事件處理。
  3. In chapter 3, two novel scheduling algorithms are put forward to supporting qos according to bin packing problem. bhps arriving are sent to different queues according to their outport, in each ourport queue, bhps are classified by their priorities and scheduled as a batch. the simulation results shows that ffd and bfd not only can provide qos effectively, but also can improve the average loss function

    通過該調度演算法，可以實現高優先級突發對低優先級的搶占，提供服務質量支持，並利用openet模擬軟體對這兩種調度演算法進行模擬。模擬結果表明，基於裝箱問題的ffd和bfd調度演算法不僅能提供有效的qos支持，還能改善系統總體的丟失性能。
  4. This paper set up the model with the queue theory, the simulation policy of event scheduling and the method of flow chart

    本文借鑒排隊理論，採用了事件調度法的模擬策略，利用流程圖法建立港口拖輪作業過程的模擬模型。
  5. Parameter controls how many jobs the queue can dispatch in any given scheduling cycle, and the

    參數控制了在任意給定調度周期隊列中可以分派多少作業，
  6. Based on the above schemes, this paper proposes the design of embedded realtime linux os used in terabit router, which combines low - latency scheme with preemption scheme to solve the non - preemptive kernel and replace the single running queue with multiple running queues in order to reduce the delay of scheduling. finally, it puts the schemes into reality and tests the performance

    在對上述方案分析的基礎上，結合t比特路由器對嵌入式實時操作系統的特殊要求，提出了t比特路由器嵌入式實時linux操作系統設計方案? ?低延遲與搶占方案相結合解決內核的非搶占機制，並且以多可運行任務隊列來代替原來的單可運行任務隊列的方法降低調度延遲。
  7. Always configure the default scheduling plug - in first ; it orders all jobs in the queue based on their queuing time

    應該總是先配置默認的調度程序插件；該插件可根據排隊時間對所有的作業進行排序。
  8. 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的公平調度問題，並提出了一種全分散式且簡單有效的新型加權排隊退避公平演算法，在改善網路中各結點接入通道公平性的同時，可實現對不同服務等級要求業務的區分服務。
  9. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  10. 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的加權輪詢調度演算法。
  11. Or it may require coding a custom scheduling plug - in that must be applied to each job queue for which the scheduling policy is to be applied

    也許這需要編寫一個定製的調度插件，它必須適用於該調度策略所使用的所有作業隊列。
  12. This thesis analyzes the differentiated service architecture and studies its control mechanisms of realizing ip qos, including packet marking policy, queue scheduling algorithm and packet dropping mechanism etc. after that a diffserv simulation platform is built using the improved diffserv model in ns2 ( network simulation 2 ) developed by u. c. berkeley and simulations have been done on it, which shows that the platform, can service different traffic flows and provide a better solution for realizing point - to - point ip qos. this thesis studies the control mechanisms of realizing ip qos in diffserv and does research work as below : firstly, this thesis studies the packet marking policies

    本文通過分析區分服務（ diffserv ）模型的體系結構，研究其實現ipqos的各種控制策略，包括分組標記策略、隊列調度演算法及擁塞時的分組丟棄機制等，利用加州大學伯克萊分校的ns2作為模擬工具，對其已有的區分服務模塊進行了改進和完善，搭建了區分服務模擬實驗平臺，並在該平臺上進行模擬測試，實現了對具有不同qos請求的業務流的區分服務，為實現端到端的ipqos提供了更好的解決方案。
  13. In this mode, the packet descriptor queue occupied few chip resource, and made the hiberarchy scheduling module with thousands of queues possible

    在這種結構中，採用數據包描述符隊列佔用的晶元資源很少，使上千個隊列的層次化調度設計成為可能。
  14. Queue scheduling and management for supporting diffserv

    支持區分服務的隊列調度與管理
  15. Using the work flow process component ’ s executing in cowe as mainline, the functionality and structure of the model ’ s eight modules and five exterior interfaces are depicted. a scheduling algorithm about executor ’ s executing the segments is innovatively presented. the algorithm uses the fcfs ( first come first served ) strategy combined the preemption strategy with time - out and out - of - queue

    以工作流流程構件在cowe中的執行為主線闡述了cowe的八個主要部件和五個外部介面的功能和設計結構，創建性地提出了cowe的執行器對執行片段的調度演算法，該調度演算法的思想是先來先服務（ fcfs ）的調度策略結合超時超長剝奪策略的調度演算法。
  16. A queue of new messages ( or a group ) within a system that are awaiting processing. the main scheduling routine will scan them along with other queues and order them into processing in order

    在系統中等待處理的一組或一隊列新信息，主調度程序對該隊列及其它隊列進行掃描，使之順序進入處理狀態。
  17. The traditional technique for managing router queue in internet usually adopts first in first out ( fifo ) scheduling and " drop tail " queue management algorithms, which have no provision for the detection of incipient congestion when the queue is full

    Internet中傳統的路由器通常採用先來先服務的調度演算法以及「棄尾」緩沖管理方法，在指示和控制擁塞方面不提供任何顯式的支持。
  18. Then define the queues by providing the queue name and its web service handle and by listing scheduling plug - ins that you ll configure

    然後，通過提供隊列名稱及其web服務句柄，並列出要配置的調度器插件，來定義隊列。
分享友人
分享到 Line

分享到臉書