A modified version of rate-monotonic scheduling algorithm and its' efficiency assessment

Proceedings - International Workshop on Object-Oriented Real-Time Dependable Systems, WORDS

Volumn 2002-January, Issue , 2002, Pages 289-294

  Naghibzadeh, M ^a  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

Author keywords

Algorithm design and analysis; Computer crashes; Delay; Design engineering; Dynamic scheduling; Process design; Random number generation; Real time systems; Safety; Scheduling algorithm

Indexed keywords

ACCIDENT PREVENTION; DESIGN; INTERACTIVE COMPUTER SYSTEMS; PROCESS DESIGN; RANDOM NUMBER GENERATION; REAL TIME SYSTEMS; SAFETY ENGINEERING; SCHEDULING ALGORITHMS;

ALGORITHM DESIGN AND ANALYSIS; COMPUTER CRASHES; DELAY; DESIGN ENGINEERING; DYNAMIC SCHEDULING;

ALGORITHMS;

EID: 84901241023     PISSN: 15301443     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WORDS.2002.1000064     Document Type: Conference Paper

References (16)

1. Klein, M., T. Ralya, B. Pollak, R. Obenza, M. G. Harbour, A Practitioners Handbook for Real-Time analysis: Guide to Rate Monotonic Analysis of Real-Time Systems, Kulwer Academic Publisher, 1993.
2. C. L. Liu and J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM, 20(1):46-61, 1973.
3. L. Sha and J. B. Goodenough. Real-Time Scheduling Theory and Ada. IEEE Computer, pages 53-62, April 1990.
4. L. Sha, R. Rajkumar and S. S. Sathaye, Generalized Rate-Monotonic Scheduling Theory: A Framework for Developing Real-Time Systems, in Proceeding of the IEEE, Vol. 82. No. 1, Jan 1994, (pp. 68-82).
5. J. A. Stancovic and K. Ramamrithan, Hard Real-Time Systems, Computer Society Press of IEEE, 1988
6. J. Leung and J. Whitehead, On the Complexity of Fixed Priority Scheduling of Periodic Real-time Tasks, Performance Evaluation, 2, 1982.
7. K. H. Kim and M. Naghibzadeh, Prevention of Task Overruns in Real-Time Nonpreemptive Multiprogramming Systems, Proceedings of ACM Performance Evaluation Review, Pages 267-276, Summer 1980.
8. J. P. Lehoczky, L. Sha, and Y. Ding, The Rate-monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior, In Proceedings of the 10th Real-Time Systems Symposium, Santa Monica, CA, December 1989.
9. Y. Manabe and S. Aoyagi, A Feasibility Decision Algorithm for Rate-Monotonic Scheduling of Periodic Real-Time Tasks, IEEE 1st Real-Time Technology and Applications Symp., pp.212-218, May 1995.
10. Y. Manabe and S. Aoyagi, A Feasibility Decision Algorithm for Rate-monotonic and Deadline Monotonic Scheduling, Real-Time Systems, Vol.14, No.2, pp.171-181, Mar. 1998.
11. J. P. Lehoczky, Fixed priority scheduling of periodic task set with arbitrary deadlines, Proc. Real-Time Systems Symposium, 1990, pp201-209
12. K. Tindell, A. Burns, and A. J. Wellings, An Extendible Approach for Analysing Fixed Priority Hard Real-Time Tasks. Real-Time Systems, 6(2):133-151, 1994.
13. S. Ghosh, R. Melhem and D. Mosse, Fault-Tolerant Rate-monotonic scheduling, Journal of Real-time systems, Vol. 15, No. 2, Sept. 1998.
14. M. Pandya and M. Malek, Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks, IEEE Transactions on Computers, Vol. 47, No. 10, 1998.
15. O. Serlin, Scheduling of time critical processes, Spring Joint Computer Conference, 925-932, 1972.
16. M. Naghibzadeh and M. Fathi, Efficiency Improvement of the Rate-Monotonic Scheduling Strategy, 3rd International IPMM Conference, July 29-August 3, 2001, Vancouver, British Colombia, Canada, 2001.