Rate Monotonic Analysis (RMA)
Date Issued
2002
Date
2002
Author(s)
DOI
20060927122902726271
Abstract
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.
Publisher
臺北市:國立臺灣大學資訊工程學系
Type
learning object
File(s)![Thumbnail Image]()
Loading...
Name
ch-rma.pdf
Size
171.97 KB
Format
Adobe PDF
Checksum
(MD5):258504ecba074f7982a6a2d883ff03bf