English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49378/84106 (59%)
造訪人次 : 7382353      線上人數 : 65
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/96128

    題名: Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
    作者: Lu, Wan-Chen;Lin, Kwei-Jay;Wei, Hsin-Wen;Shih, Wei-Kuan
    貢獻者: 淡江大學電機工程學系
    關鍵詞: Real-time systems;periodic tasks;fixed-priority preemptive scheduling;schedulability analysis
    日期: 2008-05
    上傳時間: 2014-03-03 16:31:26 (UTC+8)
    摘要: Real-time systems using rate-monotonic fixed priority scheduling can be checked for schedulability either by sufficient but pessimistic schedulability conditions or by exact testing. Exact testing provides a more precise result but may not be performed in polynomial time. Audsley et al. proposed one of the earliest methods by iteratively deriving the response times of jobs. Other researchers have improved the exact test method by using different initial values for testing. In this paper, we propose new initial values of p, - p, , and f in a task set of i tasks, where p, is the period of task Tl. We show that the new initial values can significantly improve the efficiency of exact testing. These period-dependent initial values can also be used for the schedulability test of multiframe task models and effectively reduce the number of iterations for testing.
    關聯: IEEE Transactions on Computers 57(5), pp.648-659
    DOI: 10.1109/TC.2007.70820
    顯示於類別:[電機工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋