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.
Question 1: "Three entities must be accountable and responsible for accident prevention." (a) List and explain these three entities. (b) Discuss the role of workers in ma
How free-space is managed using bit vector implementation? The free-space list is implemented as a bit map or bit vector. Each block is shown by 1 bit. If the block is free, th
(a) Describe services of operating systems. (b) Differentiate among the short term, medium term and long term scheduling that are given by multi-tasking operating systems.
LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec
Define the OS/2 threads code The sample program in Listing is very similar to the NetWare example. OS/2 commands are substituted for the pseudocode commands controlling thread
Developing Code with Threads Writing code to support a thread-based implementation is very straightforward. Simple APIs are presented to the developer for each threads package.
Define Virtual memory Virtual memory is employed in all major commercial operating systems
Explain the ExitThread Function used in the Windows NT ExitThread(ExitCode) The ExitThread( ) call is made to end the currently running thread. If the current thread is th
explain hierarchical,hashed and inverted paging
Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I
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