
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Wei Kuan Shih, J.W.S. Liu, C.L. Liu, "Modified RateMonotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines," IEEE Transactions on Software Engineering, vol. 19, no. 12, pp. 11711179, December, 1993.  
BibTex  x  
@article{ 10.1109/32.249662, author = {Wei Kuan Shih and J.W.S. Liu and C.L. Liu}, title = {Modified RateMonotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines}, journal ={IEEE Transactions on Software Engineering}, volume = {19}, number = {12}, issn = {00985589}, year = {1993}, pages = {11711179}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.249662}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Modified RateMonotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines IS  12 SN  00985589 SP1171 EP1179 EPD  11711179 A1  Wei Kuan Shih, A1  J.W.S. Liu, A1  C.L. Liu, PY  1993 KW  modified ratemonotonic algorithm; periodic jobs; deferred deadlines; semistatic prioritydriven algorithm; time instant; old requests; current request; independent jobs; feasibly scheduled; job scheduling; request deadline; deterministic scheduling theory; embedded systems; operating system; realtime systems; scheduling algorithms; computational complexity; multiprogramming; operating systems (computers); realtime systems; scheduling VL  19 JA  IEEE Transactions on Software Engineering ER   
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 semistatic prioritydriven 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 ratemonotonic algorithm and is based on the wellknown ratemonotonic algorithm. It is shown that the modified ratemonotonic 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 realtime environment,"J. ACM, vol. 20, no. 1, pp. 4661, Jan. 1973.
[2] S. K. Dhall and C. L. Liu, "On a realtime scheduling problem,"Oper. Res., vol. 26, no. 1, pp. 127140, 1978.
[3] J. Y.T. Leung and J. Whitehead, "On the complexity of fixedpriority scheduling of periodic, realtime jobs,"Perform. Eval., vol. 2, pp. 237250, 1982.
[4] K. Jeffay, "Analysis of a synchronization and scheduling discipline for realtime tasks with preemption constraints," inProc. 20th IEEE RealTime Systems Symp., Dec. 1989, pp. 295305.
[5] J. P. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithmExact characterization and average case behavior," inProc. IEEE RealTime Syst. Symp., 1989.
[6] J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,"Proc. 11th RealTime Systems Symp., IEEE CS Press, Los Alamitos, Calif., Order No. 2112, 1990, pp. 201212.
[7] J. W. Stoughton and R. R. Mielke, "Strategies for concurrent processing of complex algorithms in datadriven 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. 756764.