國立臺灣大學資訊工程學系郭大維2006-09-272018-07-052006-09-272018-07-052002http://ntur.lib.ntu.edu.tw//handle/246246/20060927122902726271Can 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.application/pdf176094 bytesapplication/pdfzh-TWlearning objecthttp://ntur.lib.ntu.edu.tw/bitstream/246246/20060927122902726271/1/ch-rma.pdf