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.
We are faced with three major components of the page-fault service time. 1. Service the page-fault interrupts. 2. Read in the page. 3. Restart the processes.
Explain about paging? Answer: Paging is a memory-management scheme that permits the physical-address space of process to be noncontiguous. Paging avoids the considerable proble
Suppose your process starts up, and allocates some memory with malloc(). The allocator will then give part of a memory page to your process. The OS then updates the corresponding p
What are the main advantages of the microkernel approach to system design? Benefits typically contain the following (a) Adding a new service does not require modifying the
Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph. b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for
1. A digitized voice channel is made by digitizing a 7 KHz bandwidth analog signal. The signal is to be sampled twice the highest frequency (two samples per hertz) . Assume each sa
Consider a particular system that does not have an interrupting clock. The only way a thread can lose the processor is to voluntarily surrender it. Additionally, the operating sy
Explain in detail about ipc in linux
Write a script that uses this idea to print output similar to the following: Files in this directory that match *~ : bash-scripts.html~ chimpanzee~ countdown~ countd
Q. If magnetic hard disks eventually have the same cost per gigabyte as do tapes will tapes turn into obsolete or will they still be needed? Describe your answer. Answer: Tap
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