Dual-mode r-reliable task model for flexible scheduling in reliable real-time systems
Pages 308 - 317
Abstract
Recent research in real-time systems has much focused on new task models for flexible scheduling and fault-tolerant real-time systems. In this paper, we propose a novel task model for the purpose of flexible scheduling in reliable real-time systems. In the proposed dual-mode r-reliable task model, a task periodically releases fast mode jobs or reliable mode jobs with the constraint that reliable mode jobs must be executed at least once for any r consecutive periods to guarantee the reliability of task. We also propose scheduling algorithms and compare performance through simulation results
References
[1]
Hamdaoui, M., Ramanathan, P.: A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transactions on Computers 44(12) (1995) 1443-1451
[2]
Koren, G., Shasha, D.: Skip-Over: algorithms and complexity for overloaded systems that allow skips. Proceedings of Real-Time Systems Symposium (1995) 110- 117
[3]
West, R., Poellabauer, C.: Analysis of a window-constrained scheduler for realtime and best-effort packet streams. Proceedings of Real-Time Systems Symposium (2000) 239-248
[4]
Bernat, G., Burns, A., Llamosi, A.: Weakly hard real-time systems. IEEE Transactions on Computers 50(4) (2001) 308-321
[5]
Mok, A.K., Chen, D.: A multiframe model for real-time tasks. IEEE Transactions on Software Engineering 23(10) (1997) 635-645
[6]
Lin, K.-J., Natarajan, S., Liu, J. W.-S.: Imprecise results: utilizing partial computations in real-time systems. Proceedings of Real-Time Systems Symposium (1987) 210-217
[7]
Liu, J. W.-S., Lin, K.-J., Shih, W.-K., Yu, A. C.-S., Chung, C., Yao, J., Zhao, W.: Algorithms for scheduling imprecise computations. IEEE Computers 24(5) (1991) 58-68
[8]
Dey, J. K., Kurose, J., Towsley, D.: On-line scheduling policies for a class of IRIS (Increasing Reward with Increasing Service) real-time tasks. IEEE Transactions on Computers 45(7) (1996) 802-813
[9]
Liestman, A. L., Campbell, R. H.: A fault-tolerant scheduling problem. IEEE Transactions on Software Engineering 12(11) (1986) 1089-1095
[10]
Krishna, C., Shin, K.G.: On scheduling tasks with a quick recovery from failure. IEEE Transactions on Computers 35(5) (1986) 448-455
[11]
Han, C.-C., Shin, K.G., Wu, J.: A fault-tolerant scheduling algorithm for realtime periodic tasks with possible software faults IEEE Transactions on Computers 52(3) (2003) 362-372
[12]
Ghosh, S., Melhem, R., Mosśe, D., Sarma, J. S.: Fault-tolerant rate-monotonic scheduling. Journal of Real-Time Systems 15(2) (1998) 149-181
[13]
Punnekkat, S., Burns, A., Davis, R.: Analysis of checkpointing for real-time systems. Journal of Real-Time Systems 20(1) (2001) 83-102
[14]
Seto, D., Krogh, B., Sha, L., Chutinan, A.: Dynamic control systems upgrade using Simplex architecture. IEEE Control Systems (1998) 72-80
[15]
Sha, L.: Dependable system upgrade. Proceedings of Real-Time Systems Symposium (1998) 440-448
[16]
Chandra, R., Liu, X., Sha, L.: On the scheduling of flexible and reliable real-time control systems. Journal of Real-Time Systems 24(2) (2003) 153-169
[17]
Liu, C.L., Layland, J.W.: Scheduling algorithms for multi-programming in a hard real-time environment. Journal of ACM 20 (1973) 46-61
[18]
Quan, G., Hu, X.: Enhanced fixed-priority scheduling with (m, k)-firm guarantee. Proceedings of Real-Time Systems Symposium (2000) 79-88
[19]
Chetto, H., Chetto, M.: Some results of the earliest deadline scheduling algorithm. IEEE Transactions on Software Engineering 15(10) (1989) 1261-1269
Index Terms
- Dual-mode r-reliable task model for flexible scheduling in reliable real-time systems
Recommendations
Load balanced reliable task scheduling algorithm for heterogeneous systems
In a heterogeneous system, processor and network failure are inevitable and can have adverse effect on the complex applications executing on the systems. To reduce the rate of these failures, matching and scheduling algorithms should take into account ...
Flexible tardiness bounds for sporadic real-time task systems on multiprocessors
IPDPS'06: Proceedings of the 20th international conference on Parallel and distributed processingThe earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (m+1)/2 on m processors if every deadline needs to be met. In recent work, ...
Comments
Information & Contributors
Information
Published In
August 2006
1165 pages
ISBN:3540366792
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 August 2006
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024