Q. Presume that the following processes arrive for execution at the times indicated. Every process will run the listed amount of time. In responding the questions use non pre-emptive scheduling and base all decisions on the information you have at the time the decision must be made.

a. What is the average revolve time for these processes with the FCFS scheduling algorithm?

b. What is the average revolve time for these processes with the SJF scheduling algorithm?

c. The SJF algorithm is supposed to improve performance however notice that we chose to run process P1 at time 0 because we did not know that two shorter processes would arrive soon. Calculate what the average turnaround time will be if the CPU is left idle for the first unit and then SJF scheduling is used. Keep in mind that processes P1 and P2 are waiting during this idle time thus their waiting time may increase. This algorithm could be recognized as future-knowledge scheduling.

Answer:

a. 10.53

b. 9.53

c. 6.86

Keep in mind that turnaround time is finishing time minus arrival time so you have to subtract the arrival times to compute the turnaround times. FCFS is 11 if you overlook to subtract arrival time.

Posted Date: 7/27/2013 2:41:41 AM | Location : United States

Ask an Expert

Related Discussions:- Fcfs scheduling algorithm, Assignment Help, Ask Question on Fcfs scheduling algorithm, Get Answer, Expert's Help, Fcfs scheduling algorithm Discussions

Write discussion on Fcfs scheduling algorithm
Your posts are moderated

Write your message here..

Related Questions

NETWORK OPERATING SYSTEM, explain about design issues of network operating ... explain about design issues of network operating system

Several cpu-scheduling algorithms, Q. Several CPU-scheduling algorithms are... Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters

What do you mean by semaphore?, What do you mean by semaphore?  Semap... What do you mean by semaphore?  Semaphore : A synchronization variable that acquires on positive integer values. Invented by the Dijkstra P (semaphore): an atomic proce

Explain the advantages and drawback of multiple processes, Explain the Adva... Explain the Advantages and Drawback of Multiple Processes Application architected to take advantage of multiple processes will certainly see performance gains. Functions and Fe

What happens when you high-level format a floppy disk, Question: a. The... Question: a. The following questions refer to a generic Windows file system: i) Describe what happens when you high-level format a floppy disk? ii) What is the maximum size

Copy on write in virtual memory, how copy on write on pages when many proc... how copy on write on pages when many process works at a same time?

Which algorithm makes the most efficient use of memory, Question : (a) ... Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are

Case studies, Did Abhinav agree to the initial timeline requested by Rebecc... Did Abhinav agree to the initial timeline requested by Rebecca

Write a short note on the linux file systems, Question: (a) Red Hat Li... Question: (a) Red Hat Linux is distributed under the Open Source agreement. Explain what you understand by Open Source distribution system. (b) Write a short note on the L

Define thread cancellation and target thread, Define thread cancellation & ... Define thread cancellation & target thread. The thread cancellation is the task of terminating a thread before it has completed. A thread that is to be cancelled is often refer