Scribd
Upload
56 views3 pages

Rts hw1 f08

This document contains 11 questions related to real-time scheduling algorithms. The questions cover topics such as preemptive vs non-preemptive scheduling, static vs dynamic scheduling, optimal vs heuristic algorithms, rate monotonic scheduling, earliest deadline first scheduling, least laxity first scheduling, schedulability analysis, and proofs of optimality for EDF and RM scheduling on uniprocessor systems. Examples are provided to illustrate task sets and schedules.

Uploaded by

Piyush Tembhurne
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
56 views3 pages

Rts hw1 f08

This document contains 11 questions related to real-time scheduling algorithms. The questions cover topics such as preemptive vs non-preemptive scheduling, static vs dynamic scheduling, optimal vs heuristic algorithms, rate monotonic scheduling, earliest deadline first scheduling, least laxity first scheduling, schedulability analysis, and proofs of optimality for EDF and RM scheduling on uniprocessor systems. Examples are provided to illustrate task sets and schedules.

Uploaded by

Piyush Tembhurne
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

COSC6384 Real-Time Systems

Assignment 1 (Fall 2008)

Question1.
Explain the difference between preemptive and non-preemptive scheduling. Discuss the
difference between static and dynamic, on-line and off-line, optimal and heuristic
scheduling algorithms.

Question2.
In real-time systems, one of the most dangerous phenomena caused by a transient
overload is referred to the situation in which the arrival of a new task causes all
previously guaranteed tasks to miss their deadlines. Assume all SINGLE instance tasks
are independent with their own (a, d, c), in which a is the arrival time, d is the deadline
and c is the computation time. Provide an example: in a previously feasible set of three
single instance tasks, all tasks are missing the deadline caused by the arrival of a new task
Jnew. You can use any scheduling algorithm.

Question3.
(a) Give two different explanations of why the periodic tasks (Period, Computation
time), (2, 1), (4, 1) and (8, 2) are schedulable by the rate-monotonic algorithm.
(b) Give two different explanations of why the periodic tasks (Period, Computation
time), (3, 1), (5, 1) and (11, 2) are schedulable by the rate-monotonic algorithm.
(c) Suppose that we add one more task into the task set in (b) where the new task’s
utilization is 0.1. Is the new task set schedulable by the rate-monotonic algorithm? Be
sure to explain your answer.

Question4.
A system consists of three periodic tasks: (3, 1), (5, 2) and (8, 3).
(a) What is the total utilization?
(b) Construct an EDF schedule of this system in the interval (0, 32). Label any missed
deadlines.
(c) Construct a RM schedule for this system in the interval (0, 32). Label any missed
deadlines.

1
Question5.
Consider the following four algorithms, the rate monotonic (RM), the deadline
monotonic (DM), the earliest deadline first (EDF) and the least laxity first (LLF).
Consider a task set composed of the following three periodic tasks all arriving at time 0:
C D T
1 3 3
1 4 4
2 3 8

Where C is the computation time, D is the RELATIVE deadline, and T is the period.
Build the schedule of the task set under the four scheduling algorithms RM, DM, EDF,
and LLF.

Question6.
(a) Use the time-demand analysis method to show that the rate-monotonic algorithm
will produce a feasible schedule of the tasks (6, 1), (8, 2), and (15, 6).
(b) Change the period of one of the tasks in part (a) to yield a set of tasks with the
maximal total utilization which is feasible when scheduled using the rate-monotonic
algorithm. (Consider only integer values for the period.)
(c) Change the execution time of one of the tasks in part (a) to yield a set of tasks with
the maximal total utilization which is feasible when scheduled using the rate-
monotonic algorithm. (Consider only integer values for the execution time.)

Question7.
Which of the following fixed-priority task(s) is not schedulable? Explain your answer.
T1 = (3, 1), T2 = (5, 1), T3 = (7, 2.5) and T4 = (16, 1).

Question8.
Prove that EDF is optimal for uniprocessors.

2
Question9
Prove the RM algorithm is an optimal static-priority algorithm for uniprocessors.

Question10.
Consider a two-task system where each preemption has an overload of x. Given C1, C2,
P1, P2, obtain the maximum value of x for which the task set is RM-schedulable.

Question11.
Determine whether there is a feasible schedule for the following set of periodic processes.
If yes, show the schedule and the steps used to derive it.

T1: c11 = 1, c12 = 3, c13 = 2, d1 = 17, p1 = 18


T2: c21 = 1, c22 = 2, d2 = 6, p2 = 6
T3: c3 = 1, d3 = p3 = 18

T1 must rendezvous with T2 after the first, second, and third scheduling blocks.
T2 must rendezvous with T1 after the first scheduling block.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy