https://github.com/99109766/fms-scheduler
Resource Management in Mixed-Criticality Systems - Flight Management
https://github.com/99109766/fms-scheduler
edf er-edf fms golang scheduler uunifast
Last synced: 3 months ago
JSON representation
Resource Management in Mixed-Criticality Systems - Flight Management
- Host: GitHub
- URL: https://github.com/99109766/fms-scheduler
- Owner: 99109766
- License: mit
- Created: 2024-12-29T11:46:30.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2025-02-02T18:39:15.000Z (4 months ago)
- Last Synced: 2025-02-02T19:32:34.201Z (4 months ago)
- Topics: edf, er-edf, fms, golang, scheduler, uunifast
- Language: Go
- Homepage:
- Size: 35.2 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Overview
The flight management system is a mixed-criticality system that includes tasks with high criticality, such as collision avoidance, and tasks with low criticality, such as cabin temperature control. Failure to correctly execute low-criticality tasks does not pose serious risks. It only reduces the quality of service, but failure to correctly execute high-critical tasks can lead to catastrophic outcomes.
As a result, a two-level mixed-criticality system, which is a type of mixed-criticality system, includes periodic LC and HC tasks. LC tasks have a single worst-case execution time, while HC tasks have two worst-case execution times. The system starts in a normal state, and if one of the HC tasks exceeds its smaller execution time, the system enters an overrun state, where high-criticality tasks are executed with their larger execution times.
As a real-time systems engineer, you must schedule the tasks under the **Policy Resource Stack** protocol using the **EDF-ER** scheduling algorithm, considering the multi-unit nature of shared resources. In this implementation, resources should be allocated to tasks to support both nested and serial access to resources.
In addition to using the predefined set of tasks labeled as **FMS**, you should use the **Uunifast** algorithm to generate a synthetic set of tasks and report the correctness of your implementation.
# Objectives
1. **Schedulability charts based on utilization rates of 0.5, 0.3, and 0.75:**
- Generate 50 tasks with an HC-to-LC ratio of 1, each resource having a random unit count between 1 and 5, total resources being 10, and the number of critical sections in each task being a random value between 0 and 8.
- Generate 50 tasks with an HC-to-LC ratio of 1, each resource having a random unit count between 1 and 5, total resources being 15, and the number of critical sections in each task being a random value between 6 and 10.
2. **Quality of Service charts based on utilization rates of 0.5, 0.7, and 0.9:**
- Generate 50 tasks with an HC-to-LC ratio of 1, each resource having a random unit count between 1 and 5, total resources being 10, and the number of critical sections in each task being a random value between 0 and 8.
- Generate 50 tasks with an HC-to-LC ratio of 1, each resource having a random unit count between 1 and 5, total resources being 15, and the number of critical sections in each task being a random value between 6 and 10.
# Phases of Implementation
1. **Phase 1:** Implement the proposed algorithm for generating and mapping resources, allocating critical sections to tasks, and determining priority levels for the generated tasks. The results should be reported as output.
2. **Phase 2:** All requested charts must be reported as output.