Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
2. In the following table, five tasks with arrival times, execution times and deadlines are given. Determine the Earliest Deadline First (EDF) schedule. Calculate the maximum lateness: Lmax. di absolute deadline.

2. In the following table, five tasks with arrival times, execution times and deadlines are given. Determine the Earliest Deadline First (EDF) schedule. Calculate the maximum lateness: Lmax. di absolute deadline.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
### Earliest Deadline First (EDF) Scheduling Consider the following set of tasks, each with specified arrival times, execution times, and deadlines. The goal is to determine the Earliest Deadline First (EDF) schedule and calculate the maximum lateness \(L_{max}\). **Table of Tasks:** | Task | Arrival Time (\(a_i\)) | Execution Time (\(C_i\)) | Deadline (\(d_i\)) | |------|-------------------------|--------------------------|--------------------| | J1 | 0 | 3 | 16 | | J2 | 2 | 1 | 7 | | J3 | 0 | 6 | 8 | | J4 | 8 | 2 | 11 | | J5 | 13 | 3 | 18 | - **EDF Schedule Determination**: In EDF scheduling, tasks are prioritized based on their deadlines, with the earliest deadline getting the highest priority. The tasks will be ordered and executed accordingly. - **Schedule Analysis**: To find the maximum lateness \(L_{max}\), we need to track the actual finish time of each task and compare it against its deadline. Lateness for a task \(J_i\) is defined as \(L_i = F_i - d_i\), where \(F_i\) is the finish time of the task, and \(d_i\) is its deadline. The maximum of these latenesses across all tasks will give us \(L_{max}\). ### Steps to Find the EDF Schedule and \(L_{max}\): 1. **Initialize the Schedule**: - Start time (\(t=0\)) - List of tasks \(T = \{J1, J2, J3, J4, J5\}\) 2. **Sort Tasks by Deadlines**: - At \(t=0\), tasks \(J1\) and \(J3\) have arrived. The deadlines are \(d1 = 16\) and \(d3 = 8\). So, \(J3\) is scheduled first. - Execute \(J3\), \(t = 6\) (since \(C3 = 6\)). - Next, tasks \(J1\), \(J2\) have arrived. The deadlines are \(
Transcribed Image Text:### Earliest Deadline First (EDF) Scheduling Consider the following set of tasks, each with specified arrival times, execution times, and deadlines. The goal is to determine the Earliest Deadline First (EDF) schedule and calculate the maximum lateness \(L_{max}\). **Table of Tasks:** | Task | Arrival Time (\(a_i\)) | Execution Time (\(C_i\)) | Deadline (\(d_i\)) | |------|-------------------------|--------------------------|--------------------| | J1 | 0 | 3 | 16 | | J2 | 2 | 1 | 7 | | J3 | 0 | 6 | 8 | | J4 | 8 | 2 | 11 | | J5 | 13 | 3 | 18 | - **EDF Schedule Determination**: In EDF scheduling, tasks are prioritized based on their deadlines, with the earliest deadline getting the highest priority. The tasks will be ordered and executed accordingly. - **Schedule Analysis**: To find the maximum lateness \(L_{max}\), we need to track the actual finish time of each task and compare it against its deadline. Lateness for a task \(J_i\) is defined as \(L_i = F_i - d_i\), where \(F_i\) is the finish time of the task, and \(d_i\) is its deadline. The maximum of these latenesses across all tasks will give us \(L_{max}\). ### Steps to Find the EDF Schedule and \(L_{max}\): 1. **Initialize the Schedule**: - Start time (\(t=0\)) - List of tasks \(T = \{J1, J2, J3, J4, J5\}\) 2. **Sort Tasks by Deadlines**: - At \(t=0\), tasks \(J1\) and \(J3\) have arrived. The deadlines are \(d1 = 16\) and \(d3 = 8\). So, \(J3\) is scheduled first. - Execute \(J3\), \(t = 6\) (since \(C3 = 6\)). - Next, tasks \(J1\), \(J2\) have arrived. The deadlines are \(
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS