ci di ai 3 Assuming a set of six (6) independent tasks with preemption. J1 J2 J3 J4 J5 J6 1 1 1 2 3 2 6 9 0 1 2 3 3 3 12 10 4 7 Based on the information/assumptions provided (there may be extra details in the table) appropriate algorithm to provide schedule the tasks in the table above. (a) Which algorithm are you using? Why? (b) You may draw AND/OR list the task ordering. - use the (c) Compute the Finish time for each task AND the overall completion time for the scheduled tasks (d) Compute the Lateness (Li) time for each task. (e) Is the schedule feasible? Why or why not? What metric did you use? (f) Based on your answers above, if the schedule is feasible, change one computation time or deadline to make it infeasible. If the schedule is NOT feasible, change as few values as possible in order to make it feasible.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Asap please
ci
di
ai
3 Assuming a set of six (6) independent tasks with preemption.
J1
J2 J3 J4 J5
J6
1
1
1
3
3
3
2
6
9 12 10
0 1
2
3
4
7
Based on the information/assumptions provided (there may be extra details in the table)
appropriate algorithm to provide schedule the tasks in the table above.
(a) Which algorithm are you using? Why?
(b) You may draw AND/OR list the task ordering.
use the
(c) Compute the Finish time for each task AND the overall completion time for the scheduled tasks
(d) Compute the Lateness (Li) time for each task.
(e) Is the schedule feasible? Why or why not? What metric did you use?
(f) Based on your answers above, if the schedule is feasible, change one computation time or deadline
to make it infeasible. If the schedule is NOT feasible, change as few values as possible in order to
make it feasible.
Transcribed Image Text:ci di ai 3 Assuming a set of six (6) independent tasks with preemption. J1 J2 J3 J4 J5 J6 1 1 1 3 3 3 2 6 9 12 10 0 1 2 3 4 7 Based on the information/assumptions provided (there may be extra details in the table) appropriate algorithm to provide schedule the tasks in the table above. (a) Which algorithm are you using? Why? (b) You may draw AND/OR list the task ordering. use the (c) Compute the Finish time for each task AND the overall completion time for the scheduled tasks (d) Compute the Lateness (Li) time for each task. (e) Is the schedule feasible? Why or why not? What metric did you use? (f) Based on your answers above, if the schedule is feasible, change one computation time or deadline to make it infeasible. If the schedule is NOT feasible, change as few values as possible in order to make it feasible.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Types of System Design
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education