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

What are the reasons for process suspension, Q. What are the reasons for pr... Q. What are the reasons for process suspension? Reasons for process suspension 1.  Swapping 2.  Timing 3.  Interactive user request 4.  Parent process request

OPERATING SYSTEM, LIST OUT THE NETWORK OPERATING OS LIST OUT THE NETWORK OPERATING OS

What are race conditions?, What are race conditions? Race conditions ar... What are race conditions? Race conditions are problems that take place due to the sharing of the same file by several processes. In such a case none of the processes is able to

Briefly explain the process management in unix., Briefly explain the proces... Briefly explain the process management in UNIX. UNIX makes use of the easy but powerful process facility that is visible to the user. UNIX follows the model in which the majori

Performance of job scheduling strategies, Performance of Job Scheduling  St... Performance of Job Scheduling  Strategies In this project you will investigate the performance of Job Scheduling strategies, Memory Allocation strategies and a CPU Scheduling s

Explain the request/response interface, Explain the Request/Response Interf... Explain the Request/Response Interface   Many issues are involved in providing a procedural interface for client functions to interact with server components. First off, since

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

Define the throughput of a system, Define the “Throughput” of a system  ... Define the “Throughput” of a system  Throughput is Number of programs processed by it per unit time

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

What is dispatch latency, What is dispatch latency? The time taken by t... What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.