https://scholars.lib.ntu.edu.tw/handle/123456789/115258
標題: | Rate Monotonic Analysis (RMA) | 作者: | 郭大維 | 公開日期: | 2002 | 出版社: | 臺北市:國立臺灣大學資訊工程學系 | 摘要: | Can we have a better way to predict the schedulability of a process set more precisely? Are we still able to predict the schedulability of a process set if the basic assumptions of rate monotonic scheduling [LL:73] are violated? Rate monotonic priorities Unique priority per unique period Preemptive scheduling Deadlines are coincident with start of period Only periodic tasks Do we have an analytical framework for reasoning the timing behavior of a process set or have an engineering basis for designing realtime systems. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/20060927122902726271 | 其他識別: | 20060927122902726271 |
顯示於: | 資訊工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ch-rma.pdf | 171.97 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。