truehang / sched_executor

0 stars 0 forks source link

Doc: background #1

Open Zard-C opened 1 year ago

Zard-C commented 1 year ago

We should introduce the background knowledge of the project in detail, including:

  1. What platform? Linux? Unix? MacOS or windows
  2. Main goals of this project
  3. What can this program do to help users or developers
  4. technical background a. tech & tools b. why use these techs or tools? c. any reference?
  5. desired effect, we can use charts and graphs to show results through comparison of performance indicators.

more details are needed.

Zard-C commented 1 year ago

A deterministic scheduler is a type of scheduler that operates in a predictable manner, ensuring that given the same input and conditions, it will always make the same scheduling decisions. This predictability is crucial in certain systems, especially in real-time and safety-critical systems, where the behavior of the system must be known and consistent under all conditions.

Here are some key points about deterministic schedulers:

  1. Predictability: The primary characteristic of a deterministic scheduler is its predictability. It will always make the same decisions given the same set of conditions.

  2. Real-time Systems: Deterministic scheduling is often used in real-time systems where tasks have strict timing constraints. Meeting these constraints consistently is crucial for the correct operation of the system.

  3. Safety-critical Systems: In systems where safety is paramount, such as in avionics or medical devices, deterministic scheduling ensures that the system behaves in a known and expected manner.

  4. Testing and Verification: The predictability of deterministic schedulers makes them easier to test and verify. Since they always behave the same way under the same conditions, testing scenarios can be replicated consistently.

  5. Rate Monotonic Scheduling (RMS): This is a common deterministic scheduling algorithm used in real-time systems. In RMS, tasks are assigned priorities based on their periods, with shorter periods getting higher priorities.

  6. Earliest Deadline First (EDF): Another deterministic scheduling algorithm, EDF assigns priorities based on task deadlines. The task with the earliest deadline gets the highest priority.

  7. Challenges: While deterministic scheduling provides predictability, it can be challenging to implement in dynamic systems where workloads can change unpredictably. Ensuring that all tasks meet their deadlines under all conditions can be complex.

  8. Overhead: Deterministic schedulers can introduce overhead due to the need for strict timing and priority checks. This overhead can impact system performance, especially in resource-constrained environments.

  9. Non-deterministic Systems: Not all systems require deterministic scheduling. Many general-purpose operating systems use non-deterministic schedulers, which make decisions based on a variety of factors and may not behave the same way under the same conditions every time.

In summary, deterministic schedulers are designed to provide consistent and predictable scheduling decisions, making them ideal for real-time and safety-critical systems. However, their predictability comes at the cost of flexibility and can introduce overhead.

Zard-C commented 1 year ago

Since we're using <sys/syscall.h>, OS is Linux or Unix like operating systems

Zard-C commented 1 year ago

@truehang can you add other information ?