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.
Forking is an important phase of Unix, critical to the support of its design strategies, which encourages the implementation of filters. In Unix, a filter is a process that reads i
Define process? What is meant by state of a process? Process is a program in implementation. A process in general includes the process stack, which consists temporary data and
What is the main advantage of multiprogramming? Multiprogramming makes efficient use of the CPU by overlapping the demands for the CPU and its I/O devices from various users. I
how do you calculate page faults
Explain fixed partitioning. Partitioning are the simpler techniques that don't involve virtual memory. Partitioning has been used in numerous variations in operating systems.
Safety algorithm : This is to make sure if the system is in safe state or not. It may need an order of m x n2 operation to determine if the state of the system is safe or not.
diffenciet between least recently used and not recently used
Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces
Q. How does the distinction among kernel mode and user mode function as a rudimentary form of protection (security) system? Answer: The distinction among kernel mode and user m
Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s
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