調度演算法 的英文怎麼說

中文拼音 [diàoyǎnsuàn]
調度演算法 英文
dispatch algorithm
  • 調 : Ⅰ動詞1 (配合得均勻合適) harmonize; suit well; fit in perfectly 2 (使配合得均勻合適) mix; adju...
  • : 度動詞[書面語] (推測; 估計) surmise; estimate
  • : 動詞1 (演變; 演化) develop; evolve 2 (發揮) deduce; elaborate 3 (依照程式練習或計算) drill;...
  • : Ⅰ動詞1 (計算數目) calculate; reckon; compute; figure 2 (計算進去) include; count 3 (謀劃;計...
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  • 調度 : 1 (調遣) dispatch (trains buses etc ) 2 (調度員) dispatcher 3 (安排) manage; control 4 (...
  1. Because of no limitation to task granularity, ppa is especially suitable for scheduling fine granularity tasks ( also suitable for coarse and medium tasks of course ), consequently helpful theoretically and practically for studying task schedule algorithm for rtdcs. according to the principle of fault - tolerant scheduling, combined with characteristics of tft in rtdcs, the paper puts forward the scheduling model of tft, corresponding implementation mechanism and the dynamic fault - tolerant scheduling algorithm ( namely ftpb ) and analyzes its complexity, with experimental data and contrast table compared with other analogic algorithm

    結合實時分佈系統中容錯任務的特點,根據容錯調原理,給出了容錯任務的調模型、實現機制及動態容錯調度演算法ftpb ,並對進行了復雜哈爾濱工程大學博士學位論文; ; ; ; ;二; ; ; ;奮石石奮; ;性分析,給出了實驗數據及與其它同類的比較結果。
  2. This paper mainly aims at the characteristics of the hardware and software structure of the parallel computer on satellite, and has fulfilled researches of fault tolerant technique in three aspects of control theories and engineering : the first research of the system level fault - tolerant module is based on the system structure of the parallel computer on satellite, a kind of cold backup module and a kind of hot backup module for multiprocessor computer have been put forward. then the research of software fault tolerant technique which is based on the operate system named rtems has been carried, the mission level fault - tolerate arithmetic and the system level fault - tolerate mechanism and strategies based on the check point technique have been put forward, at the same time the self - repair technique of software which has used the technique of system re - inject has been studied. finally the technique of components level fault - tolerant based on fpga has been studied, a kind of two level fault - tolerant project which aims at the fault - tolerant module of the parallel computer on satellite has been put forward, and the augmentative of circuit that project design realization need is little, this project can avoid any breakdown of any part logic circuit of the fpga

    本課題主要針對星載并行計機體系結構及軟體結構的特點,從如下三個方面進行了容錯控制理論研究和實踐工作:首先進行了基於星載多cpu并行計機體系結構的系統級容錯模型研究,提出了一種多cpu冷備份容錯模型和一種多cpu熱備份容錯模型;然後進行了基於rtems操作系統的軟體容錯技術研究,提出了任務級容錯調度演算法以及基於檢查點技術的系統級容錯恢復機制和策略,同時研究了利用系統重注入進行軟體在線自修復的容錯技術;最後研究了基於fpga的部件級容錯技術,提出了對容錯模塊這一星載并行計機關鍵部件的兩級容錯方案,實現該方案所需增加的電路少,可避免板級晶元以及fpga晶元內部任何邏輯發生單點故障。
  3. An algorithm for backfill - based

    并行作業調度演算法
  4. A heuristic algorithm for flow shop problem in batch processing

    成組排序問題的調度演算法設計及其界的估計
  5. So it ’ s very important to do research in it. this thesis has a detailed analysis on common smt cache replace strategy and slot schedule strategy, and finds some deficiencies in their design. we propose a new cache replace algorithm, caducity cache replace algorithm

    本文詳細研究了常見的smt處理器中cache資源所應用的cache替換,以及取指功能部件中所應用的線索調策略,從cache替換以及線索調度演算法這兩個角,提出了幾種新的
  6. Crossbar scheduling algorithm based on pre - matched islip

    基於匹配預測的交換調度演算法
  7. Task duplication based evolutionary scheduling algorithm

    基於任務復制的進化調度演算法
  8. Firstly, we find the resources in the breadth first search way, at the mean time, hop field is generated, and then, we schedule the resources according to the hop field

    本文提出一種新型的網格資源調度演算法最小跳數,首先通過廣搜索遍歷找到資源,並同時生成跳數場,再根據跳數調資源。
  9. An improved least - laxity - first scheduling algorithm for periodic tasks

    改進的最低鬆弛優先周期任務調度演算法
  10. 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支持,還能改善系統總體的丟失性能。
  11. To deal with the difference on operating system level, this paper designs a thread - level algorithm based upon priority inheritance protocol to prevent priority inversion. a dynamic priority mapping and scheduling algorithm to achieve strict order is also presented. through analysis of multi - threaded execution order under fixed priority scheduling model, a multithreaded programming model with totally predicable execution order is proposed

    針對各種操作系統的差異,本文提出了基於優先級繼承協議的線程級防優先級翻轉,提出了能夠嚴格保序的動態優先級映射方及相關的調度演算法,通過研究固定優先級調下的多線程執行順序問題,本文還提出了一種執行順序可預測的多線程程序設計模式。
  12. 4. a new round robin algorithm. lfrr is proposed

    4 .提出了一種新的分組循環調度演算法lfrr 。
  13. This methodology will enable designers to map network - processing applications onto the current np architectures without the time consuming process of manually optimizing through experimentation. it will accelerate the design flow for products, leading to shorter design turn around time

    在基於多處理器的實時優化調上,提出了一種基於包處理時間預測的負載均衡哈希調度演算法flbhda ( forecasting - basedloadbalancehashdispatchalgorithm ) 。
  14. Chapter 4 studies scheduling algorithm of the core node to implement on single adsp2191. the result shows that a single adsp2191 chip can ’ t satisfy the bhp processing delay request and parallel processing is inevitable. chapter 5 primarily studies the core node ’ s scheduling algorithm with many dsp parallel process. details of lauc - vf scheduling algorithm analysis data flow organization and mission distribution are argued. the results of software simulation and hardware debugging indicate that many dsp parallel processing is effective and coincident with the system ’ s demand

    結果表明單片adsp2191晶元不能夠滿足核心節點對bhp的實時處理要求,必須多dsp并行處理。第五章研究了核心節點調度演算法的多dsp并行處理。對多bhp批調度演算法的實現進行分析,探討了多bhp處理任務的的劃分和分配方案;多dsp間數據通信和傳輸的dma實現;最後對多處理器并行的處理時間進行模擬測試分析。
  15. Predicting allocation algorithm in distributed real - time systems

    分散式實時系統中的預測調度演算法
  16. 2. presenting banyan network ' s propert, conflict and the neccesary and sufficent condions of conflict. then, three routing algorithms are presented on realizing permutation routing based on time domain approach under the constraint of avoiding crosstalk, and the complexity of the algotithms are analysed

    2 、給出了banyan網路的一些性質及實現置換路由的沖突次數及發生沖突的充要條件,並且給出了基於時域的無串擾的實現置換路由的三種調度演算法,討論了的時間復雜以及所需要的調次數的上界。
  17. In the process of every segments design, main masks are the design of mobile terminal, software program of the management and dispatching center, and system integration

    在系統設計中,主要完成了車載移動終端的設計和管理調中心的調度演算法設計。
  18. The paper introduces database design theory 、 scada real - time data theory and flexible data interface briefly, and put forewords that using scada powerful script to design pbs dispatching algorithm

    論文介紹了數據庫設計理論、 scada實時數據理論及其靈活的數據介面,並提出了應用scada組態軟體強大的腳本語言設計pbs調度演算法
  19. In design flow modeling, a new design flow model definition method based on object oriented colorful petri net is put forward. in sub _ task dispatching, the task database, the task dispatch algorithm, the task dispatching time and its amending algorithm, the task dispatching execution plan etc. are designed. in version management, the version model of design object is built and the relationship between the linkers in dfms model and the version model about design objects is studied

    在相關的關鍵技術研究中,提出了一套包括通信模型的建立、通信原語的設計、通信服務器的設計等內容在內的被動式協同設計通信方案;設計了一種基於面向對象有色petri網技術的設計流程模型定義方;提出了一種基於調時間和資源狀況的子任務調方案,並完成了任務數據庫的設計、子任務調度演算法的設計、子任務調時間及其修正的設計和子任務調實施方案的設計等工作;建立了設計對象的版本模型,研究了設計流程模型的各種連接器與設計對象各種版本間的對應關系。
  20. Secondly, we propose a heuristic schedule algorithm based on deadline and survivability, taking the latest finish time of application assigned by users as a qos example

    第二,以「用戶指定的其所能容忍的應用程序完成的最晚時間」這種qos為例,給出了一種基於deadline和生存性的啟發式調度演算法
分享友人