The Community for Technology Leaders
Green Image
<p>The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-driven algorithm for scheduling periodic jobs with deferred deadlines: each job is assigned two priorities, the higher one for old requests and the lower one for the current request. This algorithm is called the modified rate-monotonic algorithm and is based on the well-known rate-monotonic algorithm. It is shown that the modified rate-monotonic algorithm is optimal when the deadline of every job is deferred by max (1, gamma -1) periods or more, where gamma is the ratio between the longest period and the shortest period. When the deadline of each job is deferred by one period of the job, any set of n independent jobs whose total utilization is equal to or less than (1+n(2/sup 1/n/-1))/2 can be feasibly scheduled by this algorithm. This bound approaches 0.845 when n approaches infinity.</p>
modified rate-monotonic algorithm; periodic jobs; deferred deadlines; semi-static priority-driven algorithm; time instant; old requests; current request; independent jobs; feasibly scheduled; job scheduling; request deadline; deterministic scheduling theory; embedded systems; operating system; real-time systems; scheduling algorithms; computational complexity; multiprogramming; operating systems (computers); real-time systems; scheduling

C. Liu, J. Liu and W. K. Shih, "Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 1171-1179, 1993.
85 ms
(Ver 3.3 (11022016))