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)

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

Related questions

Q: Referring to the digraph above, schedule the tasks on two processors using the decreasing-time-list…

Q: The main advantage of a multiprogramming system is: A More than one job can be processed at a given…

A: the answer is an all of the above

Q: A system contains five tasks. There are three resources X, Y, and Z. The resource requirements of…

A: The answer is as follow:

Q: How can we make the most efficient use of the CPU's time while it is juggling a large number of…

A: Basics: A CPU in a PC performs an action or a series of processes known as computer processing when…

Q: When translating conditionals or loops, the generated low-level code contains jumps. For the CPU to…

A: i. Symbolic addresses allow code generators to generate code that is easier to read, understand, and…

Q: a computer running a program that requires 250 seconds, where 70 seconds is spent executing FP…

A: Computer running program time :-250 secs Total Time spent :-250 FP instructions in…

Q: In the above, we had the three concurrent processes p1, p2 and p3, each with the number s1 = 2, s2 =…

A: According to the information given:- We have to follow the instruction to perform above task.

Q: How can we prevent a CPU from wasting time by trying to run too many programmes at once? How does…

A: In a modern computing system, the CPU is responsible for executing instructions and performing…

Q: How can we prevent a CPU from wasting time running too many programmes? How does the lack of…

A: There are a few tactics that can be used to stop a CPU from spending time running too many programs:…

Q: Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI…

A: Given : Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. This program…

Q: Algorithms or problems they solve are sometimes described as hard or intractable. This is often a…

A: The correct answer is B.

Q: It's possible that using a virtual machine would be the best time- and effort-saving approach. If…

A: Auxiliary space's complicated nature: The complexity of the supplemental space required by…

Q: ent monitor consuming 10,000 of that. When control is to be assigned to an interactive user, the…

A: Primitive time sharing operating system uses multi programming mechanism and also CPU scheduling to…

Q: Assume a primitive time-sharing operating system is running on a computer with 50,000 32-bit words…

A: Primitive time sharing operating system uses multi programming mechanism and also CPU scheduling to…

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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

How can we prevent a CPU from wasting time running too many programmes? How does the lack of resources affect this strategy? Provide a sample of their outcomes.
So many programs need to be run, but how can we prevent the CPU from doing so? What happens to the viability of this strategy if certain required resources are not available? What's one of the knock-on effects that might result from it?
A machine cycle consists of these four parts, and is also sometimes called a process loop. What portions of machine cycles are most appreciated? Is it necessary to worry about the replacement of individual machine cycle components? Does adding another module help with the issue of switching between them?
Two distinct schools of thought exist with regards to virtual machines. Draw some parallels between the two.
We can program machines to perform at a human level of intellect. Is there a certain field where we should prioritize developing such computers?Can you recommend any applications that should be avoided? Why?
Given an instruction sequence with instructions in classes A, B, and C as the table below: Instruction Class A B C |CPI Instruction Count|10|40|10| 2 1 3 Total number of instructions in this sequence = Number of clock cycles from instruction class A = Number of clock cycles from instruction class B = Number of clock cycles from instruction class C = Total number of clock cycles = Average CPI for this instruction sequence = (Answer with a float the decimal point, e.g. 4.5)
We can give machines human-level intelligence via programming. Is there a specific use case for which we should prioritize the rapid development of such computers?Is there anything that must be avoided at all costs in the application process? Why?
Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101. Q3. Assume the system has a 16-Byte direct mapped unified L1 cache with a block size of 2 Bytes. The following table shows how the cache looks like after the first access to the memory is finished. Please show; in the provided table, how it looks like after the 20th access is finished. You could ignore the "Data" Column. (Add or remove Rows/Columns in the provided table for your answer, as you see fit). Cache contents after the 1st access: Cache Index…
Write an assembly program using assembly lanuage called "Equation.asm" that calculates the following: A = B * 3 +6 / (X + D) where B == 10, X == 4, D == 2 Define all variables as Word TAKE USER INPUT FOR B , X , and D. You will get 10 extra credits if your program works correctly with any user input for those three variables (B, X, D).