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

Us constitution, what branch of goverment were the federal courts are? what branch of goverment were the federal courts are?

Closed loop gain and open loop gain of operation amplifier, Ask question #M... Ask question #Minimum 150 words

Microsoft, Discuss the high barriers to entry in the market for PL operatin... Discuss the high barriers to entry in the market for PL operating systems

Write a short note about the different states of a process, Write a short n... Write a short note about the different STATES of a process. As a process implement it changes state. The state of a process is described in part by the current activity of that

Describe two segment-replacement algorithms, Q. Segmentation is alike to p... Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

What is multiprogramming, What is Multiprogramming? Multiprogramming is... What is Multiprogramming? Multiprogramming is the capability of am operating system to support multiple applications running concurrently. Multiprogramming simply means that an

Which are the different states of a process, Which are the different states... Which are the different states of a process?   Different status of a process is: New: When the process is created. Running: When instructions are executed. Wait

Explain beladys anomaly, Explain Belady's Anomaly? Also called FIFO ano... Explain Belady's Anomaly? Also called FIFO anomaly. Usually, on enhancing the number of frames allocated to a process virtual memory, the process implementation is faster, beca

Naming scheme for servers in an enterprise, Problem: Within a corporate... Problem: Within a corporate environment, there are usually many servers located across various departments. Naming of servers is often a tedious task. In many circumstances, w

Example of producer consumer - semaphore, Now let's implement bounded produ... Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo