Please enable JavaScript.

Coggle requires JavaScript to display documents.

Real-Time Scheduling and Schedulability Analysis (Scheduling Provides 2…

- - - - Prove job can miss deadline on ly if total utilization > utilization bound
        Verify total utilization <= utilization bound
- - - - Optimal dynamic priority scheduling
      - A task with a shorter deadline has a higher priority
    - - The runnable processes are executed in the order determined by their priority
      - In real-time systems, the "priority" of a process is derived from its temporal requirements, not its importance to the correct functioning of the system or its integrity
      - Rate Monotonic Priority Assignment
        
        The shorter the period, the higher the priority
      - Each process has a fixed, static, priority which is computer pre-run--time
  - - - Better for short jobs
      - Fair
    - - Context-switching time adds up for long job
  - - - foreground (interactive)
      - background (batch)
    - - foreground -RR
      - background -FCFS
    - - each queue gets a certain amount of CPU time which it can schedule amongst its processes
  - - - blocks
      - uses time slice
      - preempted by higher-priority thread