Software safety: why, what, and how
ACM Computing Surveys (CSUR)
Real-time Euclid: a language for reliable real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
Tutorial: fault-tolerant computing
Tutorial: fault-tolerant computing
Scheduling algorithms for hard real-time systems: a brief survey
Tutorial: hard real-time systems
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Computer-controlled systems: theory and design (2nd ed.)
Computer-controlled systems: theory and design (2nd ed.)
A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering
On satisfying timing constraints in hard-real-time systems
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Scheduling hard real-time systems: a review
Software Engineering Journal - Special issue on real-time software
ACM Transactions on Computer Systems (TOCS)
Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
An On-Line Algorithm for Checkpoint Placement
IEEE Transactions on Computers
Real time and dependability concepts
Distributed systems (2nd Ed.)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Architecture of the space shuttle primary avionics software system
Communications of the ACM
Real-Time Systems Design and Analysis: An Engineer's Handbook
Real-Time Systems Design and Analysis: An Engineer's Handbook
Advances in Real-Time Systems
Digital Control and Estimation: A Unified Approach
Digital Control and Estimation: A Unified Approach
Event-Triggered Versus Time-Triggered Real-Time Systems
Proceedings of the International Workshop on Operating Systems of the 90s and Beyond
Value vs. deadline scheduling in overload conditions
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Why time-triggered architectures will succeed in large hard real-time systems
FTDCS '95 Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
A Study of Failure Models in Feedback Control Systems
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
| Hi-index | 0.00 |
This paper discusses the stabilityof a feasible pre-run-time schedule for a transient overloadintroduced by processes re-execution during an error recoveryaction. It shows that the stability of a schedule strictly tunedto meet hard deadlines is very small, invalidating thus backwarderror recovery. However, the stability of the schedule alwaysincreases when a real-time process is considered as having anominal and a hard deadline separated by a non-zero grace time.This is true for sets of processes having arbitrary precedenceand exclusion constraints, and executed on a single or multiprocessorbased architecture. Grace time is not just the key element forthe realistic estimation of the timing constraints of real-timeerror processing techniques. It also allows backward error recoveryto be included in very efficient pre-run-time scheduled systemswhen the conditions stated in this paper are satisfied. Thisis a very important conclusion, as it shows that fault-toleranthard real-time systems do not have to be extremely expensiveand complex.