Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Computers often have to deal with scheduling the programs whích are submitted to them by program- mers. Programmers often require computers to finish running programs quickly. Programmers are very unpredictable and submit programs at arbitrary times. Programmers may also submit programs that take different amounts of time to complete. Programmers are being generous for this problem by allowing preemption. That is, the computer is allowed to switch from working on one program to another program while retaining progress. Suppose we have a single-processor computer which can only run one program at a time. Let J be a set of n jobs. Each job has an arrival time A, and a required amount of processing time P,. The computer doesn't know when jobs will arrive, but once the job arrives, it is given the quantity P,. A job is complete once the computer has worked on it for P, units of time. After all the jobs are completed, we will compute a metric to measure how good the scheduling was. Let the completion time of job J; in a given schedule be C;. The average completion time over the set of all jobs is:

Computers often have to deal with scheduling the programs whích are submitted to them by program- mers. Programmers often require computers to finish running programs quickly. Programmers are very unpredictable and submit programs at arbitrary times. Programmers may also submit programs that take different amounts of time to complete. Programmers are being generous for this problem by allowing preemption. That is, the computer is allowed to switch from working on one program to another program while retaining progress. Suppose we have a single-processor computer which can only run one program at a time. Let J be a set of n jobs. Each job has an arrival time A, and a required amount of processing time P,. The computer doesn't know when jobs will arrive, but once the job arrives, it is given the quantity P,. A job is complete once the computer has worked on it for P, units of time. After all the jobs are completed, we will compute a metric to measure how good the scheduling was. Let the completion time of job J; in a given schedule be C;. The average completion time over the set of all jobs is:

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
Computers often have to deal with scheduling the programs which are submitted to them by program- mers. Programmers often require computers to finish running programs quickly. Programmers are very unpredictable and submit programs at arbitrary times. Programmers may also submit programs that take different amounts of time to complete. Programmers are being generous for this problem by allowing preemption. That is, the computer is allowed to switch from working on one program to another program while retaining progress. Suppose we have a single-processor computer which can only run one program at a time. Let J be a set of n jobs. Each job has an arrival time A; and a required amount of processing time P;. The computer doesn't know when jobs will arrive, but once the job arrives, it is given the quantity P. A job is complete once the computer has worked on it for P; units of time. After all the jobs are completed, we will compute a metric to measure how good the scheduling was. Let the completion time of job J; in a given schedule be C;. The average completion time over the set of all jobs is: J,EJ Describe and analyze a scheduling algorithm which minimizes the the average completion time.
Transcribed Image Text:Computers often have to deal with scheduling the programs which are submitted to them by program- mers. Programmers often require computers to finish running programs quickly. Programmers are very unpredictable and submit programs at arbitrary times. Programmers may also submit programs that take different amounts of time to complete. Programmers are being generous for this problem by allowing preemption. That is, the computer is allowed to switch from working on one program to another program while retaining progress. Suppose we have a single-processor computer which can only run one program at a time. Let J be a set of n jobs. Each job has an arrival time A; and a required amount of processing time P;. The computer doesn't know when jobs will arrive, but once the job arrives, it is given the quantity P. A job is complete once the computer has worked on it for P; units of time. After all the jobs are completed, we will compute a metric to measure how good the scheduling was. Let the completion time of job J; in a given schedule be C;. The average completion time over the set of all jobs is: J,EJ Describe and analyze a scheduling algorithm which minimizes the the average completion time.
Expert Solution
trending now

Trending now

This is a popular 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