Guaranteed on-line weakly-hard real-time systems

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2001, Pages 25-35

  Bernat, Guillem ^a   Cayssials, Ricardo ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSIDAD NACIONAL DEL SUR   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

QUALITY OF SERVICE; RESOURCE ALLOCATION; SCHEDULING;

BI-MODAL SCHEDULERS (BMS);

REAL TIME SYSTEMS;

EID: 0035680590     PISSN: 10528725     EISSN: None     Source Type: Journal    
DOI: 10.1109/REAL.2001.990593     Document Type: Article

References (15)

1. Applying new scheduling theory to static priority preemptive scheduling
2. Combining (n m)-hard deadlines with dual priority scheduling
3. Weakly-hard real-time systems
4. Minimizing aperiodic response times in a firm real-time environment
5. Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
6. Dual priority scheduling
7. A dynamic priority assignment technique for streams with (m, k)-firm deadlines
8. Evaluating dynamic failure probability for streams with (m, k)-firm deadlines
9. Skip-over: Algorithms and complexity for overloaded systems that allow skips
10. A multiframe model for real-time tasks
11. Enhanced fixed-priority scheduling with (m, k)-firm guarantee
12. Priority inheritance protocols: An approach to real-time synchronization
13. Distributed real-time task monitoring in the safety-critical system melody
14. An optimal, on-line window-constrained scheduler for real-time heterogeneous activities
15. Analysis of a window-constrained scheduler for real-time and best-effort packet streams