Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
In the mean while the fork() system call the Kernel creates a copy of the parent process's address space and adds it to the child process. But the vfork() system call do no
Now let us present an implementation of a producer-consumer system using condition variables. This implementation works. dequeue() lock(A) while (queue empty) { wait(A, C)
what are the factors influencing the choice of a mode of transportation?
Page fault is a trap to the software gained by the hardware when a process accesses a page that is goes in the virtual address space, but not added in physical memory. In the har
Example 1. The diagram illustrating the data structures of in-memory VFS objects and on-disk objects and their relationships on slide 24 of the lecture notes OSD.4. This diagram i
What are the different methods for handling deadlocks? Deadlock detection and recovery: Permit the system to enter a deadlock state, detect it and after that rec
Define drawback of Distributed systems Reliability is a drawback of Distributed systems
What is virtual memory? Virtual memory is a method that allows the execution of processes that might not be completely in memory. It is the separation of user logical memory fr
What is an I/O subsystem? The control of devices connected to the computer is a main issue while designing operating systems. Since I/O devices differ widely in their function
Device Drivers Communicates straight with peripheral devices (disks, tapes, etc.). Responsible for begin physical I/O operations on the device. Pro
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd