18
Probabilistic Results for Mixed Criticality Real-Time Scheduling Bader N. Alahmad Sathish Gopalakrishnan

Probabilistic Results for Mixed Criticality Real-Time Scheduling

  • Upload
    andra

  • View
    35

  • Download
    0

Embed Size (px)

DESCRIPTION

Probabilistic Results for Mixed Criticality Real-Time Scheduling. Bader N. Alahmad Sathish Gopalakrishnan. Example. Platform. Single Processor Preemptive. Simpler case : Independent Job Model. independent (one-shot) jobs Job characterized by  Release Time  Absolute Deadline - PowerPoint PPT Presentation

Citation preview

Page 1: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Probabilistic Results for Mixed Criticality Real-Time Scheduling

Bader N. AlahmadSathish Gopalakrishnan

Page 2: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Example

Page 3: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Platform

Single ProcessorPreemptive

 

Page 4: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Simpler case: Independent Job Model

independent (one-shot) jobs

Job characterized by

Release Time Absolute Deadline Criticality

Page 5: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Job Criticality• Codifies (potential) overload conditions• In overload, jobs with higher criticality

have infinite marginal utility of execution over lower criticality ones

Page 6: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Execution behaviours

•  

Page 7: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

MC-Schedulability/Scheduling

Need to find a scheduling policy…

 MC-Schedulability

MC-Scheduling

Page 8: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Approach: Worst Case Reservation (WCR) Scheduling

•  

Page 9: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Performance Metric? How to quantify the quality of the solution ?

Resource Augmentation Processor speed up factor

1

Processor is a unit capacity

bin

 

 

Page 10: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

WCR

Optimal (Oracle)• If system criticality

level = 1: all criticality 1 jobs execute and are allowed to fully utilize the processor

• If system criticality level = 2: all criticality 2 jobs execute and are allowed to fully utilize the processor

WCR• If system criticality

level = 1: all criticality 1 jobs execute and are allowed to fully utilize the processor

• If system criticality level = 2: all jobs execute and are allowed to fully utilize the processor

Page 11: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

WCR-Schedulability

If an instance is WCR-schedulable on a processor it is MC-schedulable on the same processor

Conversely, if an instance with criticality levels is MC-schedulable on a given processor it is WCR-schedulable on a processor that is times as fast,

and this factor is tight.

Page 12: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Own Criticality Based Priority (OCBP)

Construct fixed priority table offline.

At each scheduling decision point, dispatch the job with the highest priority.

Priorities assigned using Audsley’s/Lawler’s method.

Page 13: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

OCBP – Speed up factor

The root of the equation

improvement of asymptotically over WCR

For dual-criticality systems: The Golden ration

Page 14: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Deterministic results are based on adversarial/worst-case behaviour.

Page 15: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Probabilistic execution times to guide execution time allocation

Mutually independent

Page 16: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Open Questions• What is a policy that minimizes expected lateness?

– Based on expected criticality level.– Lateness: Response Time – Deadline.

• What is a policy that minimizes tardiness/lateness ratio?– Tardiness ratio: Response Time/Deadline.

• What is a policy that minimizes the probability of a deadline miss?

Page 17: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

Current InvestigationFinite Horizon Bandit Process

Dynamic Allocation Indexes (DAI) e.g., Gittins Index for multi-armed bandit processes

Model as Markov Decision Processes

Class of Optimal Stopping Problems

Dropping times and time(s) to engage in job execution are random

Page 18: Probabilistic Results for Mixed  Criticality  Real-Time  Scheduling

?