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.
What are the various page replacement algorithms used for page replacement? FIFO page replacement Optimal page replacement LRU page replacement LRU approximat
Invalid page fault :If a page fault happens for a reference to an address that's not part of the virtual address space, so that there could not be a page in memory corresponding
Crumbles Bakery needs to decide how many and what types of cupcakes to make today. Currently, they make two types of cupcakes: chocolate cupcakes and carrot cake cupcakes. Chocolat
The code should be nicely formatted with plenty of comments. It should be easy to read, properly The summary section should include three parts: (1) Record the running t
What disadvantages are there to this two-level directory? Without other provisions, two users who require cooperating with each other are hampered in reaching every other's fi
Explain Swapping Swapping is a method of temporarily removing inactive programs from the memory of computer system.
Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. The center of the disk is the location having the fewest average distanc
Explain how the os implements virtual memory phenomenon.
What is logical address space and physical address space? The set of all logical addresses formed by a program is known as a logical address space; the set of all physical addr
How Memory utilization factor shall be computed Memory utilization factor shall be defined as Memory in use/total memory connected
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