scheduling algorithm 中文意思是什麼

scheduling algorithm 解釋
調度演算法
  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. Crossbar scheduling algorithm based on pre - matched islip

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

    基於任務復制的進化調度演算法
  4. An improved least - laxity - first scheduling algorithm for periodic tasks

    改進的最低鬆弛度優先周期任務調度演算法
  5. 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

    針對各種操作系統的差異,本文提出了基於優先級繼承協議的線程級防優先級翻轉演算法,提出了能夠嚴格保序的動態優先級映射方法及相關的調度演算法,通過研究固定優先級調度下的多線程執行順序問題,本文還提出了一種執行順序可預測的多線程程序設計模式。
  6. 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實現;最後對多處理器并行的處理時間進行模擬測試分析。
  7. Thirdly, decision - making algorithms of agents were offered, including release control algorithm, dispatching algorithm and machine maintenance scheduling algorithm

    最後,通過實例,給出了方法的使用過程,並進行了模擬模擬。
  8. Scheduling algorithm for cdma2000 1x ev - do high data rate on the forward link

    前向鏈路高速分組數據傳輸中的調度演算法
  9. A job - shop scheduling algorithm using chained list

    調度問題的演算法
  10. In this approach, remaining operating time ( rot ) is divided into two types : one is relative rot, and the other is absolute rot. a new dispatching rule, i. e. the maximum relative rot of part is priority, is presented. this scheduling algorithm is proven to be effective by examples and theory analysis

    論文重點研究了在單件、小批量生產方式下,基於啟發式的作業車間調度問題,提出了優先分配啟發式演算法的一種新的優先分配規則,即相對剩餘加工時間最大的概念,並從理論分析和軟體實現兩個方面驗證了該演算法的有效性。
  11. Based on our extensive study of many different scheduling optimizations, we can summarize the results into five scheduling rules. based on the rules and the heuristics branch and bound algorithm we can obtain an optimal scheduling algorithm for both layers of our model

    根據不同生產方式優化調度研究成果得出了五個調度規則,應用這些規則與分枝定界方法分別構造出上、下層調度模型的啟發式分枝定界優化演算法。
  12. We analysis the conflict, convert channel and starvation problems of concurrent schedule based on strict - 2pl locking protocal which applies nhstm model, then present a concurrent scheduling algorithm making use of buffer and point p. also, we proved the concurrent schedule algorithm is serializable. at the same time, we introduce the key technical used in nhsdb concurrency control mechanism, and give the implementation details

    我們對應用nhstm模型的,通過應用嚴格兩段鎖協議實施的並發調度中,可能存在的並發沖突,隱通道和饑餓問題進行分析,在此基礎上提出了一種利用緩沖和p點的並發調度演算法,並給出了該演算法的並發調度正確性證明,解決多級安全條件下的隱通道和饑餓問題。
  13. Batch - scheduling algorithm based on optical bcp buffering

    基於光突發控制包緩存的批調度演算法
  14. High - efficiency dynamic task - scheduling algorithm for grids

    網格環境下的高效動態任務調度演算法
  15. The computation of response time of first come first serve scheduling algorithm

    調度演算法響應時間的計算
  16. Because of the defect of long running time and big complexity in the classical job - shop scheduling algorithm, the paper brought forward an intelligent optimization algorithm based on rule ; scheduling process is divided to primary process and optimization process. through the method of ahp ( analytical hierarchy process ), the effect is researched between several rules and estimate. moreover, the results of ahp are used as a measurable standard to scheduling results

    本文針對傳統車間作業調度演算法運行時間長,復雜度大的缺點,提出了基於規則的智能優化調度演算法,將排序的過程分為初始排序與優化排序;基於多目標決策的層次分析方法,得出了各種規則與系統評價指標之間的影響度,其結論為生產計劃方案的選擇提供了定量的參考依據。
  17. With each user ' s sub - channel snrs, the transmitter then schedules the transmission to one particular selected with proportional fair scheduling algorithm

    發射端根據回饋的信噪比,採用比例調度演演算法選出期望用戶。
  18. Rms ( rate - monntonic scheduling algorithm ) in acos is an optimal static priority algorithm for scheduling independent, preemptible, periodic tasks

    Acos中的單調速率調度演算法( rms )對于可獨立、可搶先調度的周期性任務是一種最佳的靜態優先級演算法。
  19. Furthermore, we present a locality - based least connection ( lblc ) scheduling algorithm, which is to improve the access locality on individual server when load on the servers is basically balanced

    並提出基於局部性最小連接( lblc )調度演算法,在服務器間負載基本平衡情況下,提高單個服務器的訪問局部性。
  20. 6. design the complex job network. then according to the character of job network, we design the advance - scheduling algorithm based on barrier to schedule job network to shorten the waiting time

    六、設計了旦有復雜依賴關系的作業網路,並根據作業網路特點,提出基於柵障的提汕凋度演算法調度作業網路,減少了作業調度的等待時間。
分享友人