本文選題：實時系統(tǒng)　切入點：雙曲線邊界　出處：《東華大學》2012年碩士論文　論文類型：學位論文

【摘要】：實時系統(tǒng)是計算機科學的一個重要領域,這類系統(tǒng)目前廣泛的應用于生產(chǎn)生活中。隨著多核/多處理器系統(tǒng)在實時應用中的日益普及,多處理器實時系統(tǒng)的研究成為當前的熱點�？烧{(diào)度性判定邊界的研究是多處理器實時系統(tǒng)領域的一個重要方面,確立多處理器可調(diào)度判定邊界具有理論和應用上的雙重意義。提高可調(diào)度性判定邊界能夠提高多處理器實時系統(tǒng)中處理器的利用率,從而提高多處理器實時系統(tǒng)的應用效率。 Lopez等學者求解出基于單調(diào)速率算法,LL判定邊界(C.L.Liu提出的基于單調(diào)速率算法的單處理器判定邊界),RAD分派策略的多處理器實時任務可調(diào)度性判定邊界,并給出了相關的證明和分析。據(jù)我們所知這是目前最好的多處理器實時任務的可調(diào)度性判定邊界。在單處理器領域,Bini等學者提出的雙曲線可調(diào)度性判定邊界,并證明了該邊界全面優(yōu)于LL邊界。由于雙曲線邊界相對于LL邊界的優(yōu)勢,本文基于雙曲線邊界對多處理器可調(diào)度性判定邊界進行了研究。 本文的主要工作包括： 1.本文基于雙曲線可調(diào)度判定邊界,RAD任務分派策略,單調(diào)速率算法給出了多處理器實時任務新的可調(diào)度性判定邊界,通過理論證明的形式驗證了新邊界的充分性和必要性。 2.分析了新邊界的性能,通過理論上的推導和大規(guī)模實驗全面系統(tǒng)的比較了新舊邊界。雖然新邊界無法全面超越舊邊界,但新舊邊界具有相容性。實驗結(jié)果表明在任何參數(shù)條件下聯(lián)合使用兩種邊界能夠顯著提高可調(diào)度任務集的數(shù)量。
[Abstract]:Real-time system is an important field of computer science, which is widely used in production and life. With the increasing popularity of multi-core / multiprocessor systems in real-time applications, The research of multiprocessor real-time systems has become a hot topic. The research of schedulability decision boundary is an important aspect in the field of multiprocessor real-time systems. It is of double significance in theory and application to establish the multi-processor schedulable decision boundary. Improving the schedulability decision boundary can improve the utilization rate of processors in multiprocessor real-time systems and thus improve the application efficiency of multi-processor real-time systems. Lopez and other scholars have solved the multi-processor real-time task schedulability decision boundary based on monotone rate algorithm based on monotone rate algorithm and the monotone rate algorithm proposed by C.L. Liu. It is known to us that this is the best schedulability decision boundary for multiprocessor real-time tasks. The hyperbolic schedulability decision boundary proposed by Bini et al. It is proved that this boundary is superior to LL boundary completely. Because hyperbolic boundary is superior to LL boundary, this paper studies the decision boundary of multiprocessor schedulability based on hyperbolic boundary. The main work of this paper includes:. 1. Based on the hyperbolic schedulable decision boundary (RAD) task allocation strategy, the monotone rate algorithm gives a new schedulability decision boundary for multiprocessor real-time tasks, and proves the adequacy and necessity of the new boundary by the form of theoretical proof. 2. The performance of the new boundary is analyzed, and the new boundary is compared systematically with the theoretical derivation and the large-scale experiment, although the new boundary can not completely exceed the old boundary. However, the new and old boundaries are compatible. The experimental results show that the number of schedulable task sets can be significantly increased by using the two kinds of boundaries under any parameters.
【學位授予單位】：東華大學
【學位級別】：碩士
【學位授予年份】：2012
【分類號】：TP332

【參考文獻】

相關期刊論文 前10條

1 王志平,熊光澤;實時調(diào)度算法研究[J];電子科技大學學報;2000年02期

2 張擁軍,張怡,彭宇行,陳福接;一種基于多處理機的容錯實時任務調(diào)度算法[J];計算機研究與發(fā)展;2000年04期

3 邢建生;劉軍祥;王永吉;;RM及其擴展可調(diào)度性判定算法性能分析[J];計算機研究與發(fā)展;2005年11期

4 彭良智,戴金海,桂先洲,單懿;強實時系統(tǒng)靜態(tài)優(yōu)先級調(diào)度的可調(diào)度性分析[J];計算機工程與應用;1999年12期

5 張惠娟,周利華;一種基于EDF算法的多處理器實時調(diào)度算法[J];計算機工程與應用;2003年30期

6 王濤;劉大昕;;多處理器單調(diào)速率任務分配算法性能評價[J];計算機科學;2007年01期

7 毛羽剛,張擁軍,金士堯;強實時系統(tǒng)的調(diào)度[J];計算機工程與科學;2000年02期

8 禹農(nóng),孫祥斌;實時系統(tǒng)中的調(diào)度算法分類研究[J];計算機工程與科學;2002年04期

9 陽春華,桂衛(wèi)華,計莉;基于多處理機的混合實時任務容錯調(diào)度[J];計算機學報;2003年11期

10 賓雪蓮;楊玉海;金士堯;;一種基于分組與適當選取策略的實時多處理器系統(tǒng)的動態(tài)調(diào)度算法[J];計算機學報;2006年01期

相關博士學位論文 前1條

1 鄒勇;開放式實時系統(tǒng)的調(diào)度方法研究[D];中國科學院研究生院（軟件研究所）;2003年

相關碩士學位論文 前1條

1 張麗娜;實時系統(tǒng)任務調(diào)度的策略與算法研究[D];哈爾濱工程大學;2008年

，

本文編號：1652844