Rate-monotonic scheduling for hard-real-time systems

European Journal of Operational Research

Volumn 96, Issue 3, 1997, Pages 429-443

  Bertossi, Alan A ^a   Fusiello, Andrea ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

Fault tolerance; Hard real time computing; Multiprocessor systems; Packing; Scheduling theory

Indexed keywords

ALGORITHMS; FAILURE ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS; REAL TIME SYSTEMS;

HARD REAL TIME SYSTEMS; RATE MONOTONIC SCHEDULING; SCHEDULING THEORY;

SCHEDULING;

EID: 0031075709     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)83306-1     Document Type: Article

References (44)

1. Audsley, N.C., "Resource control for hard-real-time systems: A review", Technical Report YCS 159, Department of Computer Science, University of York, August 1991.
2. Audsley, N.C., Burns, A., Davies, R.I., Tindell, K.W., and Wellings, A.J., "Fixed priority preemptive scheduling: An historical perspective", Real-Time Systems 8 (1995) 173-198.
3. Audsley, N.C., Bums, A., Richardson, M.F., and Wellings, A.J., "Hard-real-time scheduling: The deadline-monotonic approach", in: Proceedings of the 8th Workshop on Real-Time Operating Systems and Software, May 1991.
4. Baruah, S.K., Rosier, L.E., and Howell, R.R., "Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor", Real-Time Systems 2 (1990) 301-324.
5. Bertossi, A.A., and Bonuccelli, M.A., "A polynomial feasibility test for preemptive periodic scheduling of unrelated processors", Discrete Applied Mathematics 12 (1985) 195-201.
6. Bertossi, A.A., and Fusiello, A., "Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks", Technical Report UTM 483, Department of Mathematics, University of Trento, Italy, February 1996.
7. Bertossi, A.A., and Mancini, L.V., "Scheduling algorithms for fault-tolerance in hard-real-time systems", Real-Time Systems 7 (1994) 229-245.
8. Bertossi, A.A., Mancini, L.V., and Rossini, F., "A fault-tolerant rate-monotonic algorithm combining passive and active replication", Technical Report UTM 468, Department of Mathematics, University of Trento, Italy, June 1995.
9. Burchard, A., Liebeherr, J., Oh, Y., and Son, S.H., "New strategies for assigning real-time tasks to multiprocessor systems", IEEE Transactions on Computers 44 (1995) 1429-1442.
10. Burns, A., Tindell, K., and Wellings, A., "Allocating hard-real-time tasks: An NP-hard problem made easy", Real-Time Systems 4 (1992) 145-165.
11. Cheng, S.T., and Agrawala, A.K., "Allocation and scheduling of real-time periodic tasks with relative timing constraints", Technical Report CS-TR-3402, Department of Computer Science, University of Maryland, College Park, MD, January 1995.
12. Chetto, H., and Chetto, M., "Some results of the earliest deadline scheduling algorithm", IEEE Transactions on Software Engineering 15 (1989) 1261-1269.
13. Davari, S., and Dhall, S., "On a periodic real-time task allocation problem", in: Proceedings of the 19th Annual International Conference on System Sciences, 1986, 133-141.
14. Davari, S., and Dhall, S., "An on line algorithm for real-time task allocation", in: Proceedings IEEE Real-Time Systems Symposium, 1986, 194-200.
15. Davies, R., and Wellings, A., "Dual priority scheduling", in: Proceedings IEEE Real-Time Systems Symposium, Pisa, Italy, December 1995.
16. Dhall, S., and Liu, C.L., "On a real-time scheduling problem", Operations Research 26, (1978) 127-141.
17. Fohler, G., and Koza, C., "Heuristic scheduling for distributed hard-real-time systems", Technical Report 12/1990, Institut für Technische Informatik, Technische Universität Wien, 1990.
18. Garey, M.R., Graham, R.L., and Johnson, D.S., "Performance guarantees for scheduling algorithms", Operations Research 26 (1978) 3-21.
19. Gosh, S., Melhem, R., and Mosse, D., "Enhancing real-time schedules to tolerate transient faults", in: Proceedings IEEE Real-Time Systems Symposium, Pisa, Italy, December 1995.
20. Joseph, M., and Pandya, P., "Finding response times in a real-time system", The Computer Journal 29 (1986) 390-395.
21. Klein, M.H., Lehoczky, J.P., and Rajkumar, R., "Rate-monotonic analysis for real-time industrial computing", IEEE Computer 27 (1994) 24-33.
22. Klein, M.H., Ralya, T., Pollak, B., Obenza, R., and Harbour, M.G., A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems, Kluwer Academic Publishers, Dordrecht, 1993.
23. Krishna, C.M., and Shin, K.G., "On scheduling tasks with a quick recovery from failure", IEEE Transactions on Computers 35 (1986) 448-454.
24. Lehoczky, J.P., "Real-time resource management techniques", in: J.J. Marciniak (ed.), Encyclopedia of Software Engineering, Wiley, New York, 1994, 1011-1020.
25. Leung, J.Y.-T., and Merril, M.L., "A note on preemptive scheduling of periodic real-time tasks". Information Processing Letters 11 (1980) 115-118.
26. Leung, J.Y.-T., and Whitehead, J., "On the complexity of fixed-priority scheduling of periodic real-time tasks", Performance Evaluation 2 (1982) 237-250.
27. Levi, S.-T., Mossé, D., and Agrawala, A.K., "Allocation of real-time computations under fault tolerant constraints", in: Proceedings IEEE Real-Time Systems Symposium, 1988, 161-170.
28. Liu, C.L., and Layland, J.W., "Scheduling algorithms for multiprogramming in a hard-real-time environment", Journal of the ACM 20 (1973) 46-61.
29. Liu, J.W.S., Shih, W.-K., Lin, K.-J., Bettati, R., and Chung, J.-Y., "Imprecise computations", Proceedings of the IEEE 82 (1994) 83-93.
30. Oh, Y., and Son, S.H., "Enhancing fault-tolerance in rate-monotonic scheduling", Real-Time Systems 7 (1994) 315-329.
31. Oh, Y., and Son, S.H., "Allocating fixed-priority periodic tasks on multiprocessor systems", Real-Time Systems 9 (1995) 207-239.
32. Rajkumar, R., Sha, L., and Lehoczky, J.P., "Real-time synchronization protocols for multiprocessors", in: Proceedings IEEE Real-Time Systems Symposium, 1988, 259-269.
33. Ramamritham, K., Stankovic, J., and Zhao, W., "Distributed scheduling of tasks with deadlines and resource requirements", IEEE Transactions on Computers 38 (1989).
34. Sha, L., Rajkumar, R., and Lehoczky, J.P., "Priority inheritance protocols: An approach to real-time synchronization", IEEE Transactions on Computers 39 (1990) 1175-1185.
35. Sha, L., Rajkumar, R., and Sathaye, S.S., "Generalized rate-monotonic scheduling theory: A framework for developing real-time systems", Proceedings of the IEEE 82 (1994) 68-82.
36. Sha, L., and Sathaye, S.S., "Distributed real-time systems design: Theoretical concepts and applications", Technical Report CMU/SEI-93-TR-2, Carnagie Mellon University, 1993.
37. Silberschatz, A., and Galvin, P.B., Operating System Concepts, Addison-Wesley, Reading, MA, 1994.
38. Sprunt, B., Lehoczky, J.P., and Sha, L., "Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm", in: Proceedings IEEE Real-Time Systems Symposium, 1988, 251-258.
39. Sprunt, B., Sha, L., and Lehoczky, J.P., "Aperiodic task scheduling for hard-real-time systems", The Journal of Real-Time Systems 1 (1989) 27-60.
40. Tanenbaum, A.S., Modern Operating Systems, Prentice-Hall, Englewood Cliffs, 1992.
41. Tindell, K., Bums, A., and Wellings, A.J., "An extendible approach for analysing fixed-priority hard-real-time tasks", Real-Time Systems 6 (1994) 133-151.
42. Verhoosel, J.P.C., Luit, E.J., Hammer, D.K., and Jansen, E., "A static scheduling algorithm for distributed hard-real-time systems", Real-Time Systems 3 (1991) 227-246.
43. Xu, J., and Parnas, D.L., "Scheduling processes with release times, deadlines, precedence, and exclusion relations", IEEE Transactions on Software Engineering 16 (1990) 360-369.
44. Zhao, W., Ramamritham, K., and Stankovic, J.A., "Preemptive scheduling under time and resource constraints," IEEE Transactions on Computers 36 (1987) 949-960.