This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines
December 1993 (vol. 19 no. 12)
pp. 1171-1179

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.

[1] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[2] S. K. Dhall and C. L. Liu, "On a real-time scheduling problem,"Oper. Res., vol. 26, no. 1, pp. 127-140, 1978.
[3] J. Y.-T. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic, real-time jobs,"Perform. Eval., vol. 2, pp. 237-250, 1982.
[4] K. Jeffay, "Analysis of a synchronization and scheduling discipline for real-time tasks with preemption constraints," inProc. 20th IEEE Real-Time Systems Symp., Dec. 1989, pp. 295-305.
[5] J. P. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm--Exact characterization and average case behavior," inProc. IEEE Real-Time Syst. Symp., 1989.
[6] J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,"Proc. 11th Real-Time Systems Symp., IEEE CS Press, Los Alamitos, Calif., Order No. 2112, 1990, pp. 201-212.
[7] J. W. Stoughton and R. R. Mielke, "Strategies for concurrent processing of complex algorithms in data-driven architectures," NASA Langley Research Center, NASA Contractor Rep. 181657, Feb. 1988.
[8] J. R. Ellis, "A new approach to ensuring deterministic processing in an integrated avionics software system," inProc. IEEE NAECON, 1985, pp. 756-764.

Index Terms:
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
Citation:
Wei Kuan Shih, J.W.S. Liu, C.L. Liu, "Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines," IEEE Transactions on Software Engineering, vol. 19, no. 12, pp. 1171-1179, Dec. 1993, doi:10.1109/32.249662
Usage of this product signifies your acceptance of the Terms of Use.