In this thesis , we will investigate the real - time strategy and scheduling algorithms for embedded linux systems 本文對嵌入式linux的實時機(jī)制和調(diào)度策略作了分析與研究。
Proposed a duplication based task scheduling algorithm with communication limits for general task graph , tdmscl 給出針對普通任務(wù)圖帶通信限制的基于復(fù)制調(diào)度算法tdmscl 。
In the interactive rendering process , a data block scheduling algorithm is used to realize the view - dependent paging 在給定參數(shù)的控制下,將多分辨率數(shù)據(jù)分為內(nèi)外存兩部分。
The schedule algorithm based on heuristic search and petri net is tested in this simulation platform 本文圍繞fms優(yōu)化調(diào)度問題,對fms建模、調(diào)度和仿真進(jìn)行了較為深入的研究。
Finally , the research trend of constraint - based scheduling algorithm was pointed out and the prospective research was also proposed 最后,指出近期的研究趨勢和進(jìn)一步的研究工作。
The production efficiency and flexibility of fms is influenced directly by the capability of optimal scheduling algorithm 因此,優(yōu)化調(diào)度算法的性能直接影響到fms的生產(chǎn)效率和應(yīng)變能力。
Simultaneously we test the rma and round robin with multiple feedback in the underlying real - time scheduling algorithm 并分別對基本的實時調(diào)度算法rma 、分時調(diào)度算法多級反饋循環(huán)調(diào)度算法進(jìn)行測試。
To 0 the default , the microsoft windows 2000 or windows server 2003 scheduling algorithms set the thread s affinity 設(shè)置為0 (默認(rèn)值) ,則由windows 2000或windows server 2003計劃算法來設(shè)置線程的關(guān)聯(lián)。
The details of the scheduling algorithm used to determine the order in which threads are executed varies with each operating system 用于確定線程執(zhí)行順序的調(diào)度算法的詳細(xì)情況隨每個操作系統(tǒng)的不同而不同。
The test results show it can increase the performance of existing duplication based task scheduling algorithm in different degree 測試表明該算法可以使已有的基于復(fù)制的調(diào)度算法都不同程度的獲得效能提升。