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!
What is the hardware support required to implement paging?
Each operating system has its own techniques for storing page tables. The majority allocates a page table for each process and a pointer to the page table is stored with the other register values in the process control block.
The hardware execution of the page table can be done in several ways. In the simplest case the page table is executing as a set of dedicated registers. These registers must be built with very high-speed logic to make the paging-address translation efficient.
The use of registers for the page table is adequate if the page table is reasonably small. For other cases the page table is kept in main memory also a page table base register (PTBR) points to the page table. Changing page tables needs changing only one register substantially reducing context-switch time.
Though the standard solution to this problem is to use a fast-lookup, special, small hardware cache called translation look-aside buffer (TLB). The TLB is an associative high speed memory. Every entry in the TLB consists of 2 parts: a value and a key. Only some TLB's stores address-space identifiers (ASID's) in an every entry of the TLB. An ASID uniquely identifies every process and is used to provide address space protection for that process. While TLB attempts to resolve virtual page numbers, it makes sure the ASID for the currently running process matches the ASID associated with the virtual page.
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
Explain Busy Waiting Semaphores Weak, Busy-wait Semaphores a) The simplest way to implement semaphores. b) Useful while critical sections last for a short time, or we com
how response times are reduced by allowing time sharing on top of multiprogramming
Explain the Fork Function Fork function causes a new process to be created. The calling progress is duplicated as an exact copy (called the child process) that differs only in
What is a Dispatcher? The dispatcher is the module that gives control of the CPU to the process selected by the short- term scheduler. This function includes: Switching
Question: (a) Briefly discuss and describe the possible RMI invocation semantics. (b) (i) What is data marshaling? (ii) Explain the role of a remote object reference dur
Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo
Explain the Resource Ownership and Control Operating systems are required to handle many different types of resources. CPU , memory, and I/O devices are some of the varied sys
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
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
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