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. An operating system sustains a paged virtual memory using a central processor with a cycle time of 1 microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have 1000 words as well as the paging device is a drum that rotates at 3000 revolutions per minute and transfers one million words per second. The subsequent statistical measurements were obtained from the system:
Compute the effective instruction time on this system assuming that the system is running one process only in addition to that the processor is idle during drum transfers.
Answer:
Effective access time = 0.99 × (1 μ sec + 0.008 × (2 μ sec)
+ 0.002 × (10,000 μ sec + 1,000 μ sec)
+ 0.001 × (10,000 μ sec + 1,000 μ sec)
= (0.99 + 0.016 + 22.0 + 11.0) μ sec
= 34.0 μ sec
Unisex Restroom Problem
What is internal fragmentation? Consider holes of 20k assume the process requests 18 bites. If we allocate accurately the request block, we are left with a hole of 2k. The over
Recall that condition variables are synchronization primitives that enable threads to wait until a particular condition occurs. Generalizing, the combination of locks and condit
Prepare Gantt Charts and Determine the Average Waiting Time 1. Classify the interaction among the processes on the basis if degree to which they are aware of each other's exi
Write a short note on disk scheduling One of the responsibities of operating system O/S is to use the hardware efficiently. Whenever a process requires I/O to or from the
i am just wondering if you have expert in nachos operating system thank you
whats the problem in two state model ?
Define LRU Page Replacement Algorithm LRU policy: LRU expands to least currently use. This policy suggests which we re- move a page whose last usage is farthest from current ti
Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.
What are batch systems? Batch systems are quite appropriate for implementing large jobs that need little interaction. The user can submit jobs and return later for the results.
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