Course syllabus adopted 2022-02-01 by Head of Programme (or corresponding).
Overview
- Swedish nameRealtidssystem
- CodeEDA223
- Credits7.5 Credits
- OwnerMPCSN
- Education cycleSecond-cycle
- Main field of studyComputer Science and Engineering, Electrical Engineering, Software Engineering
- DepartmentCOMPUTER SCIENCE AND ENGINEERING
- GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail
Course round 1
- Teaching language English
- Application code 12118
- Maximum participants56
- Block schedule
- Open for exchange studentsNo
Credit distribution
Module | Sp1 | Sp2 | Sp3 | Sp4 | Summer | Not Sp | Examination dates |
|---|---|---|---|---|---|---|---|
| 0117 Examination 4.5 c Grading: TH | 4.5 c |
| |||||
| 0217 Laboratory 3 c Grading: TH | 3 c |
In programmes
- MPALG - COMPUTER SCIENCE - ALGORITHMS, LANGUAGES AND LOGIC, MSC PROGR, Year 1 (elective)
- MPCSN - COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 1 (elective)
- MPEES - EMBEDDED ELECTRONIC SYSTEM DESIGN, MSC PROGR, Year 1 (compulsory elective)
- MPHPC - HIGH-PERFORMANCE COMPUTER SYSTEMS, MSC PROGR, Year 1 (compulsory elective)
- MPSOF - SOFTWARE ENGINEERING AND TECHNOLOGY, MSC PROGR, Year 1 (compulsory elective)
- MPSOF - SOFTWARE ENGINEERING AND TECHNOLOGY, MSC PROGR, Year 2 (elective)
- TKDAT - COMPUTER SCIENCE AND ENGINEERING, Year 3 (elective)
Examiner
Jan Jonsson- Professor, Computer and Network Systems, Computer Science and Engineering
Eligibility
General entry requirements for Master's level (second cycle)Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Specific entry requirements
English 6 (or by other approved means with the equivalent proficiency level)Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Course specific prerequisites
Knowledge corresponding to a course in machine-oriented programming using the high-level language C. Courses in concurrent programming and operating systems are recommended.Aim
An embedded system is a computer system designed to perform one or a few dedicated functions. It is embedded in the sense that it is part of a complete device, often including electrical hardware and mechanical parts. For reasons of safety and usability, some embedded systems have strict constraints on non-functional behavior such as computational delay and periodicity. Such systems are referred to as real-time systems. Examples of real-time systems are control systems for cars, aircraft and space vehicles as well as computer games and multimedia applications. This course is intended to give basic knowledge about methods for the design and analysis of real-time systems.Learning outcomes (after completion of the course the student should be able to)
Knowledge and understanding:- Formulate requirements for embedded systems with strict constraints on computational delay and periodicity.
- Demonstrate knowledge about the terminology used within the theory of scheduling and computational complexity.
- Describe the principles and mechanisms used for designing run-time systems and communication networks for real-time applications.
- Describe how the general principles of real-time programming are implemented in different high-level programming languages.
Competence and skills:
- Construct concurrently-executing tasks (software units) for real-time applications that interface to hardware devices (sensors/actuators).
- Apply the basic analysis methods used for verifying the temporal correctness of a set of executing tasks.
Judgement and approach:
- Reason about advantages and disadvantages regarding the choice of software design and scheduling algorithm for a real-time system given certain performance requirements.
Content
Due to the extremely high costs associated with late discovery of problems in embedded systems, it is important to follow a good design methodology during the development of the software and hardware. One means for that is to use a system architecture that offers good component abstractions and facilitates simple interfacing of components. The system architecture philosophy dictates that the software of an embedded system is organized into multiple concurrently-executing tasks, where each task (or group of tasks) implements a specific functionality in the system. This approach allows for an intuitive way of decomposing a complex system into smaller software units that are simple to comprehend, implement and maintain. The software environment used in the course is based on the C programming language, enhanced with a software library that provides support for programming of concurrent tasks with timing (delay and periodicity) constraints. To that end, a main objective of the course is to demonstrate how the enhanced C programming language is used for implementing communication/synchronization between tasks, resource management and mutual exclusion. Since other programming languages uses monitors or semaphores to implement these functions, the course also contains a presentation of such techniques. In addition, the course demonstrates how to use low-level programming in C to implement interrupt-driven interaction with hardware devices. To demonstrate the general principles in real-time programming, the course also gives examples of how these techniques are implemented in other programming languages, such as Ada and Java. In order to execute a program containing concurrent tasks there is a run-time system (real-time kernel) that distributes the available capacity of the microprocessor(s) among the tasks. The course shows how a simple run-time system is organized. The run-time system determines the order of execution for the tasks by means of a scheduling algorithm. To that end, the course presents techniques based on cyclic time-table based scheduling as well as scheduling techniques using static or dynamic task priorities. In addition, protocols for the management of shared hardware and software resources are presented. Since many contemporary real-time applications are distributed over multiple computer nodes, the course also presents topologies and medium access mechanisms for some commonly-used communication networks. In real-time systems, where tasks have strict timing constraints, it is necessary to make a pre-run-time analysis of the system schedulability. The course presents three different analysis methods for systems that schedule tasks using static or dynamic priorities: utilization-based analysis, response-time analysis, and processor-demand analysis. In conjunction with this, the course also gives an account on how to derive the maximum resource requirement (worst-case execution time) of a task.Organisation
The course is organized as a series of lectures and a set of exercise sessions where the programming techniques and theories presented at the lectures are put into practice. The course material is examined by means of a final written exam. In addition, there is a compulsory laboratory assignment in which the students should implement the software for a music playing application with strict timing constraints. Apart from the programming of cooperating concurrent tasks, the laboratory assignment also encompasses low-level programming of hardware devices such as timers and network controllers.Literature
Lecture notes. Selected texts from archival journals, conference proceedings and books. Compendium of exercises.Examination including compulsory elements
A written exam and a laboratory assignment. The final grade, according to the scale Fail (U) or Pass (3, 4, 5), is given based on the grades for the written exam and the laboratory assignment.The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.