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

Linear Programing, . A paper mill produces two grades of paper viz., X and ... . A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

Define a state which is not a fundamental process state, Define a state whi... Define a state which is not a fundamental process state Answer: Blocked state is not a fundamental process state

Competing process, describe competing process describe competing process

Critical section, what is deckers algorithm what is deckers algorithm

Backup and recovery, what is it all about? why do we need? what are the typ... what is it all about? why do we need? what are the types of backup? how is it done in unix?

Explain the demand paging system, Question : (a) In the demand paging ... Question : (a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The

How program execute in operating system, Q. How Program execute in operatin... Q. How Program execute in operating system? Program execution: Operating system loads a program in memory and executes the program. The program should be able to end its exec

Architects applications by making use of multitasking, Architects Applicati... Architects Applications by Making Use of Multitasking As the capability of computer hardware keeps increasing, operating systems are presented with overwhelming opportunities.

Unix and linux commands, To explore the UNIX file system, use basic UNIX co... To explore the UNIX file system, use basic UNIX commands and use a text editor. Task:   1.      Logon to Linux. 2.      Create a directory "Unix" under your home d

Implementing group policies in a windows environment, Question: (a) As... Question: (a) As a System administrator, elaborate on how you can manage computer accounts in Active Directory of Windows Server 2008? (b) Explain the following user p