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
i am just wondering if you have expert in nachos operating system thank you
How could we implement locks? No matter how we choose to implement them, we must have some hardware support. One possibility for implementing locks on a uniprocessor machine is is
Inverted page table In page table the page table has one entry for every page that the process is using. The operating system must translate this reference into a physical memo
Determine the Requiring Variables on the Scope of a Thread It is very common in server application programs to require variables on the scope of a thread. To provide such a sco
Question : a) What do you understand by a Directory Structure? Support your answer with a diagram. b) Give an example how Access Lists and Groups are arranged to mode of
List the task regions in the Spiral model. Customer communication - In this region it is suggested to set up customer communication. Planning - All planning activities
Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU
Q. Presume an operating system maps user-level threads to the kernel using the many-to-many model and the mapping is done through LWPs. Additionally the system allows developers to
FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance
What is the use of multiprogramming on individual processors ? In the usual multiprocessor, which is dealing with independent or coarse-grained synchronization granularity, it 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