Real-time systems and their programming languages
Real-time systems and their programming languages
Real-time computer control (2nd ed.): an introduction
Real-time computer control (2nd ed.): an introduction
Building Large, Complex, Distributed Safety-Critical OperatingSystems
Real-Time Systems - Special issue on safety-critical systems
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Robust aperiodic scheduling under dynamic priority systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Value vs. deadline scheduling in overload conditions
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Response Time Analysis of Asynchronous Real-Time Systems
Real-Time Systems
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Periodic Resource Model for Compositional Real-Time Guarantees
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Scheduling algorithms based on weakly hard real-time constraints
Journal of Computer Science and Technology
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
IEEE Transactions on Computers
Computers and Operations Research
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
Compositional real-time scheduling framework with periodic model
ACM Transactions on Embedded Computing Systems (TECS)
Dynamic priority scheduling-based MAC for wireless sensor networks
International Journal of Sensor Networks
Stochastic DVS-based dynamic power management for soft real-time systems
Microprocessors & Microsystems
Flexible hard real-time scheduling for deliberative AI systems
Real-Time Systems
Optimal Control of Discrete Event Systems with Weakly Hard Real-Time Constraints
Discrete Event Dynamic Systems
Real-time task scheduling by multiobjective genetic algorithm
Journal of Systems and Software
Scalability and QoS guarantee for streams with (m,k)-firm deadline
Computer Standards & Interfaces
Real-Time Object-Based Video Segmentation Using Colour Segmentation and Connected Component Labeling
IVIC '09 Proceedings of the 1st International Visual Informatics Conference on Visual Informatics: Bridging Research and Practice
Designing real-time embedded controllers using the anytime computing paradigm
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Dynamic routing of real-time jobs among parallel EDF queues: A performance study
Computers and Electrical Engineering
Non-preemptive fuzzy classification algorithm for non-traditional safety-critical systems
Journal of Embedded Computing - Advanced Topics on Embedded Computing
Proceedings of the 2011 International Conference on Communication, Computing & Security
Reconfiguration-aware real-time scheduling under QoS constraint
Proceedings of the 16th Asia and South Pacific Design Automation Conference
Energy minimization for real-time systems with (m; k)-guarantee
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Analysis of a dynamic assignment of impatient customers to parallel queues
Queueing Systems: Theory and Applications
Using negotiation techniques as time-restricted scheduling policies on intelligent agents
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Dual-mode r-reliable task model for flexible scheduling in reliable real-time systems
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Experiments study on a dynamic priority scheduling for wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Embedded Systems Design
Embedded Systems Design
Embedded Systems Design
Preservation of timing properties with the ada ravenscar profile
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Proceedings of the 20th International Conference on Real-Time and Network Systems
Generalized weakly-hard constraints
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Compositional real-time scheduling framework for periodic reward-based task model
Journal of Systems and Software
Formal analysis of sporadic bursts in real-time systems
Proceedings of the Conference on Design, Automation and Test in Europe
Formal analysis of sporadic overload in real-time systems
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Challenges and new trends in probabilistic timing analysis
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Analysis of an $$M/M/1+G$$M/M/1+G queue operated under the FCFS policy with exact admission control
Queueing Systems: Theory and Applications
| Hi-index | 14.99 |
In a hard real-time system, it is assumed that no deadline is missed, whereas, in a soft or firm real-time system, deadlines can be missed, although this usually happens in a nonpredictable way. However, most hard real-time systems could miss some deadlines provided that it happens in a known and predictable way. Also, adding predictability on the pattern of missed deadlines for soft and firm real-time systems is desirable, for instance, to guarantee levels of quality of service. We introduce the concept of weakly hard real-time systems to model real-time systems that can tolerate a clearly specified degree of missed deadlines. For this purpose, we define four temporal constraints based on determining a maximum number of deadlines that can be missed during a window of time (a given number of invocations). This paper provides the theoretical analysis of the properties and relationships of these constraints. It also shows the exact conditions under which a constraint is harder to satisfy than another constraint. Finally, results on fixed priority scheduling and response-time schedulability tests for a wide range of process models are presented.