Scribd
Upload
54 views

Process Management (Part 1) : Klara Nahrstedt Spring 2008

This document discusses scheduling requirements for real-time multimedia processing systems. It provides an overview of rate-monotonic scheduling (RMS) and earliest deadline first (EDF) scheduling policies for real-time tasks, including examples and admission control tests. It also outlines requirements for an upcoming student competition involving multimedia process management, including presentation dates and times for different groups.

Uploaded by

Vijay Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
54 views

Process Management (Part 1) : Klara Nahrstedt Spring 2008

This document discusses scheduling requirements for real-time multimedia processing systems. It provides an overview of rate-monotonic scheduling (RMS) and earliest deadline first (EDF) scheduling policies for real-time tasks, including examples and admission control tests. It also outlines requirements for an upcoming student competition involving multimedia process management, including presentation dates and times for different groups.

Uploaded by

Vijay Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

CS 414 Multimedia Systems Design

Lecture 32 Process Management (Part 1)


Klara Nahrstedt Spring 2008
CS 414 - Spring 2008

Outline

MP4 is out, Start early Deadline April 30


Finalists will preview their solutions (grading) on April 29, 4-6pm in 0216 SC All non-finalists groups will be graded on April 30 3 -5pm, 0216 SC Competition will be on April 30, between 5-7, 0216 SC Judged by CEO of Pavlov company, and possibly by Thompson company representative Exact rules, scenarios of the competition will be posted next Monday.

All should come, pizza and 1,2,3rd prices of the competition will be provided between 6:30-7pm on April 30 in 0216 SC
CS 414 - Spring 2008

Real-time Processing Requirements

Need to process continuous multimedia data


Processing

occurs in predetermined, usually periodic

intervals Processing must be completed by certain deadlines

Need RT process manager


Perform

admission control Determine schedule Perform reservation Schedule to give processing guarantees

CS 414 - Spring 2008

RT Processing Requirements
Main Problem: How to find a feasible schedule? Conflicting Goals/Problems: How do we schedule multimedia (RT) processes so that

non-RT processes do not starve when RT process is running 2. RT process is not subject to priority inversion
1.
CS 414 - Spring 2008

Model in RT Scheduling

Task (Process) schedulable unit Task characterized by


Timing constraints Resource requirements Periodic tasks without precedence relations s task starting point e task processing time d task deadline p task period
CS 414 - Spring 2008

Assumptions

Time constraints

Model of RT Scheduling

Congestion avoidance deadline


If

period at (k-1) step is equal to ready (start) time of period k

Tasks: preemptive vs. non-preemptive Main goal of RT Scheduling: find feasible schedule of all periodic tasks so that newly arriving task and all previous admitted tasks finish processing in every period according to their deadline
CS 414 - Spring 2008

Model of RT Scheduling
Must have Schedulability (Admission) Test for RT tasks What is the performance metric for RT tasks?

Guarantee

ratio := number of guaranteed n tasks/total number of tasks ei U Process utilization (U):

i 1

pi

CS 414 - Spring 2008

Scheduling Policies of RT Tasks

Rate- Monotonic Scheduling (RMS)


Designed/proved

by C.L. Liu and Layland 1973 Policy: task with highest rate has highest priority Static and optimal, priority-driven

Optimal means that there no other static algorithm that is able to schedule a RT task which cant be scheduled by RMS algorithm Assumptions:

Tasks are periodic Each task must complete before next request All tasks are independent Run-time of each task request is constant Any non-periodic task has no required deadline
CS 414 - Spring 2008

Example of RMS

CS 414 - Spring 2008

Scheduling Policies for RT Tasks

Earliest Deadline First (EDF) Policy


Optimal

dynamic algorithm Produces valid schedule if one exists Complexity O(n2) Upper bound of process utilization 100% Policy: task with earliest deadline has highest priority

CS 414 - Spring 2008

Example of EDF

CS 414 - Spring 2008

Comparison between RMS and EDF

CS 414 - Spring 2008

Admission Control (for preemptive tasks)

Schedulability test for RMS

U ln 2

i 1

ei ln 2 pi

Schedulability test for EDF

U 1

i 1

ei 1 pi

CS 414 - Spring 2008

Example

Consider the following preemptive RT tasks and their characteristics


T1:

p1 = 50ms, e1=10ms T2: p2 = 100ms, e2=20ms T3: p3 = 200ms, e3=50ms T4: p4 = 100ms, e4=20ms

Are these tasks schedulable via RMS?


If

yes, what is the feasible schedule? yes, what is the feasible schedule?
CS 414 - Spring 2008

Are these tasks schedulable via EDF?


If

Conclusion
RMS and EDF are basic policies for realtime scheduling systems For multimedia systems, soft-real-time scheduling (SRT) concepts needed, connecting reservation-based and adaption-based SRT Next lecture we look at DSRT system that shows implementation of hybrid SRT systems

CS 414 - Spring 2008

You might also like