Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

7. Let job set J-Ji, J2, J3, J4), J (ri, Ci, di), where ri, Ci, and d are the arrival time, the worst case execution

image text in transcribed

7. Let job set J-\Ji, J2, J3, J4), J (ri, Ci, di), where ri, Ci, and d are the arrival time, the worst case execution cycles, and deadline for Ji, respectively. Let Ji-(1, 3, 16), J (4. 4, 24), J3 12, 5, 22), J.-(0, 2, 40) be scheduled on an ideal DVS processor according to EDF. Find the voltage schedule that can minimize the dynamic energy consumption to complete these jobs in time. 8. Given three jobs tI, T2, T3, T4 with characteristics illustrated below, ? : Highest priority; to access three critical sections CS, CS2, and CS3 With length of CS?! = 8, ICS; -9, ICS; =1; ?2- Second highest priority, to access two critical sections CS, CS4 with CS1 7, |CS411; ?3. Third highest priority; to access four critical sections CS, CS, CS3. and CS4 with |CSi|-5, |CS2l 6, CS3 7, |CS4-6; a. b, c. d. t4; Fourth highest priority; to access four critical sections CSi, CS2, CS3, and CS4 with [CS1-7, CS2?-3, CS3-12, CS4]=10; e. The critical sections with the same names access the same resource. What is the maximum blocking factor for each task when using the priority inheritance protocol and the priority ceiling protocol? DRAW the application scenarios and explain when each task has the largest blocking factor under each protocol 7. Let job set J-\Ji, J2, J3, J4), J (ri, Ci, di), where ri, Ci, and d are the arrival time, the worst case execution cycles, and deadline for Ji, respectively. Let Ji-(1, 3, 16), J (4. 4, 24), J3 12, 5, 22), J.-(0, 2, 40) be scheduled on an ideal DVS processor according to EDF. Find the voltage schedule that can minimize the dynamic energy consumption to complete these jobs in time. 8. Given three jobs tI, T2, T3, T4 with characteristics illustrated below, ? : Highest priority; to access three critical sections CS, CS2, and CS3 With length of CS?! = 8, ICS; -9, ICS; =1; ?2- Second highest priority, to access two critical sections CS, CS4 with CS1 7, |CS411; ?3. Third highest priority; to access four critical sections CS, CS, CS3. and CS4 with |CSi|-5, |CS2l 6, CS3 7, |CS4-6; a. b, c. d. t4; Fourth highest priority; to access four critical sections CSi, CS2, CS3, and CS4 with [CS1-7, CS2?-3, CS3-12, CS4]=10; e. The critical sections with the same names access the same resource. What is the maximum blocking factor for each task when using the priority inheritance protocol and the priority ceiling protocol? DRAW the application scenarios and explain when each task has the largest blocking factor under each protocol

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Introduction To Data Mining

Authors: Pang Ning Tan, Michael Steinbach, Vipin Kumar

1st Edition

321321367, 978-0321321367

More Books

Students also viewed these Databases questions