On satisfying timing constraints in hard-real-time systems

On satisfying timing constraints in hard-real-time systems

The authors explain why pre-run-time scheduling is essential if one wishes to guarantee that timing constraints will be satisfied in a large complex hard-real-time system. They examine some of the major concerns in pre-run-time scheduling and consider what formulations of mathematical scheduling pro...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on software engineering 1993-01, Vol.19 (1), p.70-84
Hauptverfasser: Xu, J., Parnas, D.L.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Application software
Computer applications
Computer engineering
Constraints
Control systems
Deadlines
Degradation
Error correction
Military computing
Predation
Processor scheduling
Real time
Scheduling
Scheduling algorithm
Software
Software safety
Systems development
Timing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The authors explain why pre-run-time scheduling is essential if one wishes to guarantee that timing constraints will be satisfied in a large complex hard-real-time system. They examine some of the major concerns in pre-run-time scheduling and consider what formulations of mathematical scheduling problems can be used to address those concerns. This work provides a guide to the available algorithms.< >
ISSN:0098-5589
1939-3520
DOI:10.1109/32.210308