Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊網路與多媒體研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/49037
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor施吉昇
dc.contributor.authorChang-Min Yangen
dc.contributor.author楊昌民zh_TW
dc.date.accessioned2021-06-15T11:14:17Z-
dc.date.available2018-09-08
dc.date.copyright2016-09-08
dc.date.issued2016
dc.date.submitted2016-08-21
dc.identifier.citation[1] “Flight control modes,” https://en.wikipedia.org/wiki/Flight_control_modes.
[2] R. Kastner, F. Schneider, T. Michalke, J. Fritsch, and C. Goerick, “Image-based classification of driving scenes by hierarchical principal component classification (hpcc),” in Intelligent Vehicles Symposium, 2009 IEEE, June 2009, pp. 341–346.
[3] C. L. Liu and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46–61, jan 1973.
[4] M. Bertogna, M. Cirinei, and G. Lipari, “Schedulability analysis of global schedul- ing algorithms on multiprocessor platforms,” IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 4, pp. 553–566, April 2009.
[5] J. W. S. Liu, W.-K. Shih, K.-J. Lin, R. Bettati, and J.-Y. Chung, “Imprecise compu- tations,” Proceedings of the IEEE, vol. 82, no. 1, pp. 83–94, Jan 1994.
[6] W.-K. Shih, J. W. S. Liu, and J.-Y. Chung, “Algorithms for scheduling imprecise computations with timing constraints,” SIAM Journal on Computing, vol. 20, no. 3, pp. 537–552, 1991.
[7] W.-K. Shih and J. W. S. Liu, “Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error,” IEEE Transactions on Com- puters, vol. 44, no. 3, pp. 466–471, Mar 1995.
[8] J. Y. Chung, J. W. S. Liu, and K. J. Lin, “Scheduling periodic jobs that allow impre- cise results,” IEEE Transactions on Computers, vol. 39, no. 9, pp. 1156–1174, Sep 1990.
[9] W.-K. Shih, C.-R. Lee, and C.-H. Tang, “A fast algorithm for scheduling imprecise computations with timing constraints to minimize weighted error,” in Real-Time Sys- tems Symposium, 2000. Proceedings. The 21st IEEE, 2000, pp. 305–310.
[10] J. Real and A. Crespo, “Mode change protocols for real-time systems: A survey and a new proposal,” Real-Time Syst., vol. 26, no. 2, pp. 161–197, Mar. 2004. [Online]. Available: http://dx.doi.org/10.1023/B:TIME.0000016129.97430.c6
[11] K.W.Tindell,A.Burns,andA.J.Wellings,“Modechangesinprioritypreemptively scheduled systems,” in Real-Time Systems Symposium, 1992, Dec 1992, pp. 100– 109.
[12] M. Ahmed, N. Fisher, and D. Grosu, “A parallel algorithm for edf-schedulability analysis of multi-modal real-time systems,” in 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Aug 2012, pp. 154–163.
[13] V. Nelis, J. Goossens, and B. Andersson, “Two protocols for scheduling multi-mode real-time systems upon identical multiprocessor platforms,” in 2009 21st Euromicro Conference on Real-Time Systems, July 2009, pp. 151–160.
[14] J. Lee and K. G. Shin, “Schedulability analysis for a mode transition in real-time multi-core systems,” in Real-Time Systems Symposium (RTSS), 2013 IEEE 34th, Dec 2013, pp. 11–20.
[15] N. Stoimenov, S. Perathoner, and L. Thiele, “Reliable mode changes in real-time systems with fixed priority or edf scheduling,” in 2009 Design, Automation Test in Europe Conference Exhibition, April 2009, pp. 99–104.
[16] R. Henia and R. Ernst, “Scenario aware analysis for complex event models and dis- tributed systems,” in Real-Time Systems Symposium, 2007. RTSS 2007. 28th IEEE International, Dec 2007, pp. 171–180.
[17] P. Pedro and A. Burns, “Schedulability analysis for mode changes in flexible real- time systems,” in Real-Time Systems, 1998. Proceedings. 10th Euromicro Workshop on, Jun 1998, pp. 172–179.
[18] T. P. Baker, “Comparison of empirical success rates of global vs. partitioned fixed- priority and edf scheduling for hard real time,” Department of Computer Science Florida State University, Tallahassee, Tech. Rep. TR-050601, 2005.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/49037-
dc.description.abstract在即時系統中,如何讓工作在時限內完成,是過去常見的研究目
標,但現今的系統會需要因應不同的需求轉換成不同的操作模式,如
在飛機系統中包含陸地、飛行等模式;如先進駕駛輔助系統中當駕駛
在高速公路或一般市區將使用不同模式,而如何能正確且有效地切換
模式是本研究目標。
並且,在現今軟體中非精確運算在影像和AI等領域被廣泛地運用,
而在本篇論文中考慮此運算模型,藉由此模型,系統可以更有效地利
用資源進行排程,並且可以縮短任務的反應時間,增進使用者體驗,
而本研究針對傳統運算模型及非精確運算模型分別提出不同的解決方
案。
為了達成上述目標,我們延伸傳統地可排程性分析的框架,提出在
多模式系統中出新的可排程性分析,在最後的實驗部分,我們藉由模
擬的方式與其他研究的分析方法進行比較,在結果中,我們的方法可
以提升15至30%的可排程工作量,並在非精確運算模型中,能夠確實
地增加可完成的工作數。
zh_TW
dc.description.abstractMost studies of real-time scheduling have focused on meeting deadlines of a given task set. However, many applications need to change operating modes depending on system states. For example, the flight control system of the aircraft depends on different functionalities and has Ground, Flight
and Flare modes. Advanced Driver Assistance Systems can have Highway, Country Road, and City modes depending on different environments. Our motivations are that how to correctly and effectively change modes.
Additionally, the imprecise computational model is widely applied to the image processing, AI system, etc. In this work, we consider this model which makes the system more flexible to schedule. Furthermore, this model can reduce the average response time, and improve User Experience (UX). We will focus on the traditional workload model and imprecise computational
model to propose solutions.
In order to address this problem, we extend the traditional schedulability analysis and develop a new analysis to the multi-mode system. In the experiment, we compare our schedulability analysis with other work by simulation. The result shows that our analysis can increase schedulability by 15 to 30%. Moreover, our work can actually increase the completed tasks during mode
change on the imprecise computational model.
en
dc.description.provenanceMade available in DSpace on 2021-06-15T11:14:17Z (GMT). No. of bitstreams: 1
ntu-105-R03944031-1.pdf: 1479181 bytes, checksum: 57bb5823eb9f170772e8169fa250d078 (MD5)
Previous issue date: 2016
en
dc.description.tableofcontents致謝 ii
摘要 iii
Abstract iv
1 Introduction 1
1.1 Motivation 1
1.2 Contribution 3
1.3 Thesis Organization 3
2 Background and Related Works 5
2.1 Background 5
2.1.1 Deadline-Base Schedulability Analysis for Multi-Core Platform 5
2.1.2 Imprecise Computational Workload Model 7
2.1.3 ImpreciseComputationScheduling 7
2.2 Related Works 8
3 Workload Model and Problem Definition 10
3.1 System and Platform Models 10
3.2 ModeChangeModel 11
3.3 WorkloadModel 12
3.4 TargetedProblem 13
4 Design of Mode Change Mechanism 14
4.1 Schedulability Analysis 14
4.1.1 Schedulability Analysis for mode change 14
4.1.2 Amount of the Interference 15
4.2 Minimum Mode Change Offset 20
4.3 Minimum Total Error 21
4.4 Analysis 22
5 Experiment 24
5.1 Evaluation of Schedulability Analysis 24
5.1.1 Experiment Environment and Workload 24
5.1.2 ExperimentResults 25
5.2 Experiment of Total Error 27
5.2.1 Experiment Environment and Workload 27
5.2.2 ExperimentResults 27
6 Conclusion 29
Bibliography 30
dc.language.isoen
dc.subject即時多核心系統zh_TW
dc.subject非精確運算zh_TW
dc.subject模式轉換zh_TW
dc.subject可排程性分析zh_TW
dc.subjectSchedulability Analysisen
dc.subjectImprecise Computational Modelen
dc.subjectMulti-Core Real-Time Systemsen
dc.subjectMode Changeen
dc.title在非精確運算及多核心處理器平台下的即時模式轉換可排程性分析zh_TW
dc.titleSchedulability Analysis of Real-Time Mode Change for Imprecise Computation on Multi-Core Platformsen
dc.typeThesis
dc.date.schoolyear104-2
dc.description.degree碩士
dc.contributor.oralexamcommittee逄愛君,王佑中
dc.subject.keyword可排程性分析,模式轉換,非精確運算,即時多核心系統,zh_TW
dc.subject.keywordSchedulability Analysis,Mode Change,Imprecise Computational Model,Multi-Core Real-Time Systems,en
dc.relation.page31
dc.identifier.doi10.6342/NTU201601830
dc.rights.note有償授權
dc.date.accepted2016-08-21
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept資訊網路與多媒體研究所zh_TW
顯示於系所單位:資訊網路與多媒體研究所

文件中的檔案:
檔案 大小格式 
ntu-105-1.pdf
  未授權公開取用
1.44 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved