Documente Academic
Documente Profesional
Documente Cultură
Fred Kuhns ()
Real-Time Characteristics
Real-time systems often are comprised of a controlling system, controlled system and environment.
Controlling system: acquires information about environment using sensors and controls the environment with actuators.
Timing constraints derived from physical impact of controlling systems activities. Hard and soft constraints.
Periodic Tasks: Time-driven recuring at regular intervals. Aperiodic: event-driven.
Fred Kuhns () CS523S: Operating Systems
Controlling System
Environment
Fred Kuhns ()
Some Definitions
Timing constraint: constraint imposed on timing behavior of a job: hard or soft. Release Time: Instant of time job becomes available for execution. If all jobs are released when the system begins execution, then there is said to be no release time Deadline: Instant of time a job's execution is required to be completed. If deadline is infinity, then job has no deadline. Absolute deadline is equal to release time plus relative deadline Response time: Length of time from release time to instant job completes.
Fred Kuhns () CS523S: Operating Systems
Soft: late completion is undesirable but generally not fatal. No validation or only demonstration job meets some statistical constraint. Occasional missed deadlines or aborted execution is usually considered tolerable. Often specified in probabilistic terms
Fred Kuhns ()
Validating Constraints
Validation: Demonstration by a provably correct, efficient procedure or by exhaustive simulation and testing. Involves three steps:
1. timing constraints of each application and corresponding components are consistent, 2. each component can meet its timing constraints if executed alone and required resources are available, 3. The underlying scheduling algorithm(s), all timing constraints are met
Fred Kuhns () CS523S: Operating Systems
Resources
Resources can be divided into passive and active:
Active resources == Processors (Pi): they execute jobs.
Every job must have one or more processors Same type if functionally identical and used interchangeably.
Fred Kuhns ()
Fred Kuhns ()
Functional Parameters
Preemptivity
Preemption: suspend job then dispatch different job to processor. Cost includes context switch overhead. Non-preemptable task - must be run from start to completion.
Criticalness - positive integer indicating the relative importance of a job. Useful during overload. Optional Executions - jobs or portions of jobs may be declared optional. Useful during overload. Laxity - Laxity type => hard or soft timing constraints. Supplemented by a usefulness function. Useful during overload.
Fred Kuhns () CS523S: Operating Systems
Resource Parameters
Job resource parameters indicate processor and resource requirements. Preemptivity of resources
non-preemptive: serial access, typical case. preemptive - jobs can interleave access.
Resource Graph:
vertex for processors (Pi) and resources (Ri) is-a-part-of edge: Ri -> Rk, Rk is a part of Ri accessibility edge: Pi -> Pk, cost of Pi accessing Pk
Fred Kuhns () CS523S: Operating Systems
Definitions
Feasible schedule: Every job starts at or after release time and completes by deadline Schedulable: set of jobs schedulable according to an algorithm if the it always produces a feasible schedule. Optimal: Scheduling algorithm optimal if it always produces a feasible schedule if such a schedule exists Tardiness: Zero if completion time <= deadline, otherwise > 0 (complete - deadline). Lateness: difference between completion time and deadline, can be negative if early.
Fred Kuhns () CS523S: Operating Systems
Performance Measures
Miss rate: percentage of jobs executed but completed late Loss rate: percentage of jobs discarded Invalid rate: sum of miss and loss rate. makespan : If all jobs have same release time and deadline, then makespan = response time of the last job to execute. Max or average response times Max or average tardiness/lateness
Fred Kuhns () CS523S: Operating Systems