Scheduling hard-real-time tasks with backup phasing delay

Proceedings - IEEE International Symposium on Distributed Simulation and Real-Time Applications, DS-RT

Volumn , Issue , 2006, Pages 107-116

  Bertossi, Alan A ^a   Mancini, Luigi V ^b   Menapace, Alessandra ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c NONE

Author keywords

Fault tolerance; Hard real time systems; Multi processors; Periodic tasks; Rate monotonic scheduling

Indexed keywords

COMPUTATIONAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS; PROGRAM PROCESSORS; SCHEDULING ALGORITHMS;

DEALLOCATE ACTIVE TASK COPIES; PASSIVE TASK DUPLICATION; PERIODIC TASKS; RATE MONOTONIC SCHEDULING;

REAL TIME SYSTEMS;

EID: 34547484835     PISSN: 15506525     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DS-RT.2006.33     Document Type: Conference Paper

References (23)

1. N. Audsley, K. Tindell, A. Burns. The end of line for static cyclic scheduling? Proc. Euromicro Workshop on Real-Time Systems, 36-41, June 1993.
2. A.A. Bertossi, A. Fusiello. Rate-monotonic scheduling for hard-realtime systems. European Journal of Operational Research 96, 429-443, 1997.
3. A.A. Bertossi, A. Fusiello, L.V. Mancini. Fault-tolerant deadlinemonotonic algorithm for scheduling hard-real-time tasks. Proc. 11th IEEE International Parallel Processing Symposium, 133-138, Geneva, Switzerland, April 1997.
4. A.A. Bertossi, L.V. Mancini. Scheduling algorithms for faulttolerance in hard-real-time systems. Real-Time Systems 1, 229-245, 1994.
5. A.A. Bertossi, L.V. Mancini, F. Rossini. Fault-tolerant ratemonotonic first-fit scheduling in hard-real-time systems. IEEE Transactions on Parallel and Distributed Systems 10, 934-945, September 1999.
6. A. Burchard, J. Liebherr, Y. Oh, S.H. Son. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Transactions on Computers 44, 1429-1442, 1995.
7. A. Burns, R. Davis, S. Punnekkat. Feasibility analysis of faulttolerant real-time task sets. Proc. Euromicro Workshop on Real-Time Systems 29-33, June 1996.
8. G. Buttazzo. Hard Real-Time Computing Systems. Real time systems series Vol 23, 2nd Edition, ISBN 0-387-23137-4, Springer Verlag, 2005.
9. M. Caccamo, G. Buttazzo. Optimal scheduling for fault-tolerant and firm real-time systems. Proc. IEEE Conference on Real-Time Computing Systems and Applications, Hiroshima, Japan, Oct. 1998.
10. H. Chetto, M Chetto An adaptive scheduling algorithm for fault-tolerant real-time systems. Software Engineering Journal, 93-100, 1991.
11. S. Dhall, C.L. Liu. On a real-time scheduling problem. Operations Research 26, 127-141, 1978.
12. S. Ghosh, R. Melhem, D. Mosse. Fault-tolerance through scheduling of aperiodic tasks in hard-real-time systems. IEEE Transactions on Parallel and Distributed Systems 8, 272-284, 1997.
13. S. Ghosh, R. Melhem, D. Mosse, J.S. Sarma. Fault-tolerant rate-monotonic scheduling. Real Time Systems 15, 149-181, 1998.
14. M. Joseph, P. Pandya. Finding response times in a real-time system. The Computer Journal 29, 390-395, 1986.
15. M.H. Klein, J.P. Lehoczky, R. Rajkumar. Rate-monotonic analysis for real-time industrial computing. IEEE Computer, 24-33, Jan. 1994.
16. C.M. Krishna, K.G. Shin. On scheduling tasks with a quick recovery from failure. IEEE Transactions on Computers 35, 448-454, May 1986.
17. S. Lauzac, R. Melhem, D. Mosse. An Improved Rate-monotonic Admission Control and its Applications IEEE Transactions on Computers 52(3), March 2003.
18. J.Y. Leung, M.L. Merrill, A note on preemptive scheduling periodic real-time tasks. Information Processing Letters 11, 115-118, 1980.
19. F. Liberato, R. Melhem, D. Mosse, Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-time Systems. IEEE Transactions on Computers 49(9), Sep 2000.
20. C.L. Liu, J.W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20, 46-61, 1973.
21. Y. Oh, S.H. Son. Enhancing fault-tolerance in rate-monotonic scheduling. Real-Time Systems 7, 315-329, 1994.
22. K. Tindell. Adding time-offsets to schedulability analysis. Technical Report YCS-221, Dept. of Computer Science, University of York, 1994.
23. K. Tindell, A. Burns, A.J. Wellings. An extendible approach for analyzing fixed-priority hard-real-time tasks. Real-Time Systems 6, 133-151, 1994.