線性加速比并行實時任務的節(jié)能算法研究
[Abstract]:The performance of embedded devices has been greatly improved, and the demand for energy has been rising. The increase of energy consumption not only restricts the increase of embedded system integration, but also requires complex heat dissipation technology, which increases the cost of products. Therefore, how to save energy more effectively has become a hot issue in embedded system research. On the other hand, with the wide use of multi-core processor technology in server and PC, multi-core technology has the characteristics of fast performance improvement and low power density at the same frequency, which makes multi-core system the dominant platform for embedded systems in the future. The existing research on multi-core energy-saving scheduling is mainly focused on the serial task (sequential tasks) model, which assumes that a task can only run on one core at any one time, but not on more than one core at the same time. This does not give play to the performance advantages of multiple nuclear technologies. Therefore, this paper focuses on the parallel task (parallel tasks) model, that is, the energy saving problem in which the task can run on all the cores of the processor at the same time. Processor power consumption in a real system is a set of discrete values corresponding to frequency. In order to simplify the model, the current discussion on the energy consumption of real-time systems often assumes that the processor frequency values are continuously changed, but this is not suitable for real systems. Therefore, in the discrete processor frequency model, which is closer to the real processor frequency change, the energy saving scheduling problem of multi-core parallel real-time tasks under linear speedup model is studied, and two satisfying time constraints are proposed. Parallel task energy consumption optimization algorithm based on Gang scheduling strategy. In this paper, we assume that all processor cores support DVS technology and the speedup is linear. Under this condition, we first give a theorem to prove that when each task is executed on all cores of the system, the energy consumption of the system is minimum. Then, the problem is modeled as a 0-1 integer linear programming, the earliest deadline first algorithm is used to determine the task scheduling, and two efficient energy-saving algorithms are given to determine the working frequency of each task. At last, through a lot of simulation experiments, it is proved that the proposed algorithm has a remarkable effect and can achieve almost the same energy saving effect as the optimal solution.
【學位授予單位】:東北大學
【學位級別】:碩士
【學位授予年份】:2013
【分類號】:TP368.1
【相似文獻】
相關期刊論文 前10條
1 鄭曉曦;張虎;鮑松堂;;提高實時內(nèi)核對實時任務響應時間的新方法[J];計算機工程與應用;2009年16期
2 李凡,盧社階,邱鵬,林愛武;在嵌入式應用中增強Linux實時性的方法研究[J];華中科技大學學報(自然科學版);2005年02期
3 錢光明;陳湘華;姜輝;;實時任務的選擇性壓縮[J];湖南文理學院學報(自然科學版);2011年01期
4 張惠娟,周水生,周利華;一種混合實時任務系統(tǒng)的公平調(diào)度算法[J];西安電子科技大學學報;2004年02期
5 吳悅;唐立三;楊洪斌;;非周期實時任務過載的判別和處理機制[J];應用科學學報;2009年02期
6 吳煒煒;張有仁;;基于概率的實時任務調(diào)度分析[J];計算機工程;2006年02期
7 余科軍;鄭蕓蕓;;分布式實時任務分配算法的設計與實現(xiàn)[J];福建電腦;2007年09期
8 萬加富;李迪;葉峰;賴乙宗;;提高混合實時任務確定性的兩級調(diào)度算法[J];吉林大學學報(工學版);2009年03期
9 萬加富;李迪;葉峰;賴乙宗;;混合實時任務的兩級調(diào)度策略[J];華南理工大學學報(自然科學版);2008年04期
10 王得利;馬月坤;于樹利;;控制系統(tǒng)中實時任務分析[J];微計算機信息;2006年07期
相關博士學位論文 前3條
1 傅朝陽;面向?qū)崟r任務求解的自治服務協(xié)同模型、形式語義及其驗證[D];浙江大學;2010年
2 朱曉敏;異構集群系統(tǒng)中實時任務若干調(diào)度問題研究[D];復旦大學;2009年
3 張寧;嵌入式內(nèi)存管理垃圾搜集器實時算法研究[D];電子科技大學;2009年
相關碩士學位論文 前10條
1 張占龍;支持混合關鍵性任務調(diào)度的多核系統(tǒng)實驗平臺研究與實現(xiàn)[D];東北大學;2013年
2 林宇晗;線性加速比并行實時任務的節(jié)能算法研究[D];東北大學;2013年
3 楊帆;共享網(wǎng)絡中的實時任務可執(zhí)行概率研究[D];國防科學技術大學;2011年
4 余洋;安全關鍵分布式實時任務調(diào)度技術研究[D];電子科技大學;2012年
5 張婧穎;實時任務的最好響應時間精確分析與計算[D];江蘇大學;2009年
6 張嘉慶;一種實時任務可調(diào)度性問題的研究[D];東北大學;2005年
7 曹博然;實時信息采集任務的服務質(zhì)量保證技術研究[D];哈爾濱工業(yè)大學;2013年
8 師政毅;基于動態(tài)容錯機制的數(shù)據(jù)傳輸實時任務分配與調(diào)度技術[D];長春理工大學;2010年
9 張向國;μCLinux硬實時化技術研究[D];哈爾濱理工大學;2008年
10 郭靖;多核系統(tǒng)下并行實時任務節(jié)能調(diào)度問題研究[D];東北大學;2010年
,本文編號:2165236
本文鏈接:http://sikaile.net/kejilunwen/jisuanjikexuelunwen/2165236.html