Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Task 2: Priority Scheduling Sample input: Process Burst Time Priority P1 P2 P3 P4 P5 10 3 1 1 2 4 1 5 2 Solution shown by a Gantt chart: P2 P5 P1 P3 P4 16 18 19 You may consult the following pseudocode to implement Priority Scheduling. completed = 0 current_time = 0 while(completed !=n) { find process with maximum priority time among process that are in ready queue at current_time if(process found) { if(process is getting CPU for the first time) { start time = current time

Task 2: Priority Scheduling Sample input: Process Burst Time Priority P1 P2 P3 P4 P5 10 3 1 1 2 4 1 5 2 Solution shown by a Gantt chart: P2 P5 P1 P3 P4 16 18 19 You may consult the following pseudocode to implement Priority Scheduling. completed = 0 current_time = 0 while(completed !=n) { find process with maximum priority time among process that are in ready queue at current_time if(process found) { if(process is getting CPU for the first time) { start time = current time

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
Microprocessor
Task 2: Priority Scheduling Sample input: Process Burst Time Priority P1 P2 P3 P4 P5 10 3 1 1 2 4 1 2 Solution shown by a Gantt chart: P2 P5 P1 P3 P4 1 16 18 19 You may consult the following pseudocode to implement Priority Scheduling. completed = 0 current_time = 0 while(completed != n) { find process with maximum priority time among process that are in ready queue at current_time if(process found) { if(process is getting CPU for the first time) { start time = current time } burst_time = burst_time - 1 current time = current time + 1 if(burst_time = 0) { completion_time = current_time turnaround_time = completion_time - arrival_time waiting_time = turnaround_time - burst_time response_time = start_time - arrival time mark process as completed completed++ } } else { current time++ }
Transcribed Image Text:Task 2: Priority Scheduling Sample input: Process Burst Time Priority P1 P2 P3 P4 P5 10 3 1 1 2 4 1 2 Solution shown by a Gantt chart: P2 P5 P1 P3 P4 1 16 18 19 You may consult the following pseudocode to implement Priority Scheduling. completed = 0 current_time = 0 while(completed != n) { find process with maximum priority time among process that are in ready queue at current_time if(process found) { if(process is getting CPU for the first time) { start time = current time } burst_time = burst_time - 1 current time = current time + 1 if(burst_time = 0) { completion_time = current_time turnaround_time = completion_time - arrival_time waiting_time = turnaround_time - burst_time response_time = start_time - arrival time mark process as completed completed++ } } else { current time++ }
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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