Analysable hard real-time system

Thomas Hedemand Nielsen, Jens Christian Schwarzer

AbstractThe concept of hard real-time systems is introduced, and an informal reference model for hard real-time systems is defined. The theory of priority-driven schedulers is presented, and the problem of validating a schedule is addressed. Synchronisation protocols are introduced to control blocking due to resource contention. A commercially available real-time operating system is investigated. Based on scheduling theory a computational model is defined, and implemented upon the particular operating system. A development process for hard real-time systems is proposed. The design phases of the proposed development process are applied to a case study.
KeywordsHard real-time development process, analysable hard real-time systems design, computational model, fixed-priority scheduling, schedulability analysis
TypeMaster's thesis [Academic thesis]
Year2001
PublisherInformatics and Mathematical Modelling, Technical University of Denmark, DTU
AddressRichard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby
SeriesIMM-EKS-2001-49
Electronic version(s)[pdf]
BibTeX data [bibtex]
IMM Group(s)Computer Science & Engineering