(3.236.222.124) 您好!臺灣時間:2021/05/11 10:07
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

: 
twitterline
研究生:趙書瑋
研究生(外文):Shu-Wei Chao
論文名稱:多核心平台上的混合工作排程
論文名稱(外文):A HYBRID TASK SCHEDULING SCHEME FOR MULTICORE PLATFORMS
指導教授:李良德李良德引用關係
指導教授(外文):Liang-Teh Lee
學位類別:碩士
校院名稱:大同大學
系所名稱:資訊工程學系(所)
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:英文
論文頁數:44
中文關鍵詞:即時多核心排程演算法
外文關鍵詞:Real-timemulti-core architecturesscheduling
相關次數:
  • 被引用被引用:0
  • 點閱點閱:124
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:17
  • 收藏至我的研究室書目清單書目收藏:0
隨著科技的進步,不論是在個人行動運算或數位家庭生活上,都朝著將各種數位服務內容整合於單一系統上。而多核心處理器架構則提供了精簡的尺寸、低耗的電能、卻擁有強大運算能力的平台,來實現各種應用內容的整合。然而面對著混合了大量即時工作與非即時工作的應用,作業系統在工作排程上對此種多目的用途單一平台的系統並無太大的變化。尤其是面對有著大量即時要求的工作,普通作業系統上的工作排程策略並無法滿足其需求,再加上很多時候系統仍須具備提供非即時工作的服務。以數位家庭生活為例:隨選視訊提供即時的多媒體服務(即時工作)、溫度溼度等的環境感知(週期性工作)、提供使用者互動的終端介面(一般工作)。對於這樣混合即時與非即時需求的工作,即便是在多核心平台上,使用一般的排程方法或單純的即時排程方法都難以達到其該有的效能。對此,我們將提出一個可能的解決排程方案,它以兩階層的方式來對即時與非即時工作做調整,不但能維持一般工作的回應時間,同時維持住其他工作的即時需求。此外有別於一般多處理器排程法,它利用多核心的特殊架構所產生的效能,可比同樣數量運算單元的多處理器架構發揮更大的效益。
With the advancement of technology, various services can be combined in a single computer system, such as Mobile Computing, and Digital Home, etc. With the properties of compact size, low power consumption, and full computing power, multicore processor systems can be used to fulfill these kind of applications. For a set of hybrid tasks which comprise large real-time and non-real-time applications, however, currently, the operating system does not have any scheduling policy to improve the performance on multicore platforms effectively. The task scheduling of operating system for general purpose applications can not satisfy the working demand of hybrid tasks, especially with large amount of real-time tasks. In this thesis, we proposed a hybrid task scheduling scheme for multicore platforms. In the proposed scheme, a two-level hierarchical scheduling is applied to adjust real-time and non-real-time tasks. It can not only maintain the response time of general tasks, but also support the real-time requirements for other tasks. The experimental results show that a higher efficiency can be obtained by applying the proposed scheme on multicore architectures.
ACKNOWLEDGMENTS ii
ABSTRACT iii
摘要 iv
TABLE OF CONTENTS v
LIST OF FIGURES vii
LIST OF TABLES viii
CHAPTER 1 INTRODUCTION 1
CHAPTER 2 BACKGROUND 2
2.1 Real-Time Task Model 3
2.2 Basic Algorithms for Periodic Tasks 4
2.2.1 Rate Monotonic Scheduling 4
2.2.2 Earliest Deadline First Algorithm 5
2.2.3 Least Laxity First Algorithm 6
CHAPTER 3 PROPOSED SCHEDULING ON MULTICORE PLATFORM 8
3.1 Hybrid Task Sets Scheduling 8
3.2 Multiprocessor Scheduling 9
3.3 Partitioning and Global Scheduling 10
3.4 Two Level Hierarchical Approach 12
CHAPTER 4 EXPERIMENTAL RESULTS 15
4.1 SESC: SuperESCalar Simulator 15
4.2 Performance Evaluation 15
CHAPTER 5 CONCLUSIONS 26
REFERENCES 27
APPENDIX 29
[1] R. Kalla, Balaram Sinharoy, and J. M. Tendler, “IBM Power5 chip: a dual-core multithreaded processor,” IEEE Micro, volume 24, issue 2, pages 40–47, Mar-Apr 2004.
[2] J. Aas, “Understanding the Linux 2.6.8.1 CPU scheduler,” Silicon Graphics, Inc., 2005.
[3] R. Jain, C. Hughs, and S. V. Adve, “Soft real-time scheduling on simultaneous multithreaded processors,” Proceedings of the 23rd Real-Time System Symposium, pages 134–145, 2002.
[4] J. M. Calandrino, D. Baumberger, Tong Li, S. Hahn, and J. H, “Anderson. Soft real-time scheduling on performance asymmetric multicore platforms,” Proceedings of the Real Time and Embedded Technology and Applications Symposium, pages 101–112, April 2007.
[5] Albert M. K. Cheng, Real-Time Systems: Scheduling, Analysis, and Verification, John Wiley & Sons, Ltd., pages 42, 2002
[6] E. Bini and G.C. Buttazzo, “Schedulability analysis of periodic fixed priority systems,” IEEE Transactions on Computers, volume 53, issue 11, pages 1462–1473, Nov. 2004.
[7] F. Cottet, J. Delacroix, C. Kaiser, and Z. Mammeri, Scheduling in Real-Time Systems, John Wiley & Sons, Ltd., pages 31–32, 2002.
[8] J. Strosnider, J. Lehoczky, and L. Sha, “The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments,” IEEE Transactions on Computers, volume 44, issue 1, pages 73–91, 1995.
[9] J. Anderson, V. Bud, and U. C. Devi, “An edf-based scheduling algorithm for multiprocessor soft real-time systems,” IEEE ECRTS, pages 199–208, July 2005.
[10] S. Baruah, N. Cohen, C. G. Plaxton, and D. Varvel, “Proportionate progress: A notion of fairness in resource allocation,” Algorithmica, volume 15, pages 600, 1996.
[11] J. Anderson and A. Srinivasan, “A new look at pfair priorities,” Technical Report TR00-023, University of North Carolina at Chapel Hill, Sept. 2000. Available at http://uuu.cs.unc.edu/~anderson/papers.html.
[12] Hyeonjoong Cho, B. Ravindran, and E. D. Jensen, “An Optimal Real-Time Scheduling Algorithm for Multiprocessors,” proceedings of the IEEE International Real-Time Systems Symposium, pages 101–110, 2006.
[13] J. Renau, SESC website http://sesc.sourceforge.net.
[14] Jack E. Veenstra and Robert J. Fowler, “MINT: a front end for efficient simulation of shared-memory multiprocessors,” Modeling, Analysis, and Simulation of Computer and Telecommunication Systems,” Proceedings of MASCOTS '94, pages 201–207, 1994.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊
 
系統版面圖檔 系統版面圖檔