Scribd
Upload
76 views1 page

Bitszg553 Mar06 FN

This document is a mid-semester test for a Real Time Systems course at BITS Pilani. It contains 5 questions related to real time systems concepts like task utilization, scheduling approaches, round robin scheduling, frame size constraints, precedence graphs, effective release times and deadlines, and the least slack time algorithm. The test has a duration of 2 hours and is closed book.

Uploaded by

vithya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views1 page

Bitszg553 Mar06 FN

This document is a mid-semester test for a Real Time Systems course at BITS Pilani. It contains 5 questions related to real time systems concepts like task utilization, scheduling approaches, round robin scheduling, frame size constraints, precedence graphs, effective release times and deadlines, and the least slack time algorithm. The test has a duration of 2 hours and is closed book.

Uploaded by

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

Birla Institute of Technology & Science, Pilani

Work-Integrated Learning Programmes Division


Second Semester 2019-2020

Mid-Semester Test
(EC-2 Regular)

Course No. : BITS ZG553


Course Title : REAL TIME SYSTEMS
Nature of Exam : Closed Book
Weightage : 30% No. of Pages =1
Duration : 2 Hours No. of Questions = 5
Date of Exam : Friday, 06/03/2020 (FN)
Note:
1. Please follow all the Instructions to Candidates given on the cover page of the answer book.
2. All parts of a question should be answered consecutively. Each answer should start from a fresh page.
3. Assumptions made if any, should be stated clearly at the beginning of your answer.

Q.1 (a) Define the term task utilization? [2]


Q.1 (b) Which kind of scheduling approach is used in hard real time system. Explain. [2]

Q.2. Schedule the following tasks using non-weighted round robin scheduling
Task Execution time
(units)
T1 5
T2 6
T3 8
T4 5

The time slice for each task is assumed to be 2 units. Compute the makespan of the schedule
and the number of cycles. [5]

Q.3. Explain Frame Size Constraints? The systems of periodic tasks is scheduled and executed
according to a cyclic schedule. For the system given below choose an appropriate frame size.
Preemptions are allowed, but the number of preemptions should be kept small. Generate a
graphical representation of tasks (8,1), (15,3), (20,4), (22,6). [10]

Q.4. Calculate the effective release time and effective deadline for the given precedence graph The
execution time of all the jobs are equal to 1. The feasible interval of each job in the precedence
graph is given next to its name. . [5]

J1 (0,10] J2 (1,5] J3 (0,6] J7 (2,8]

J4 (1,6] J5 (2,1] J6 (3,9]

Q.5 (a) What is slack of a job? Explain? [2]


Q.5 (b) For the set of task given below, schedule and generate the graphical representation for
LST algorithm. (Note: Deadline is the absolute deadline given in the table) [4]

____________

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