What is the hardware support required to implement paging, Operating System

Assignment Help:

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.

 


Related Discussions:- What is the hardware support required to implement paging

Explain a computing environment, Q. Polling for an I/O completion is able ...

Q. Polling for an I/O completion is able to waste a large number of CPU cycles if the processor iterates a busy-waiting loop several times before the I/O completes. However if the

Explain the threadswitch function used in the netware, Explain the ThreadSw...

Explain the ThreadSwitch function used in the netware Since NetWare 3 and 4 are nonpreemptive environments, it may be necessary for the application developer to explicitly reli

Thread, Explain thread in details

Explain thread in details

File system, what are disadvantages of using single directory

what are disadvantages of using single directory

Long term scheduler, Long term scheduler calculates which processes are a...

Long term scheduler calculates which processes are admitted to the machine for processing. It accepts the degree of multiprogramming. Once accepted, a job converts a process.

Memory management, example of first fit best fit and worst fit

example of first fit best fit and worst fit

Deadlocks, At the end of this lecture, and into the next lecture, we will d...

At the end of this lecture, and into the next lecture, we will discuss the last major type of logical error that can occurwhen programming with threads. A deadlock occurswhen two t

Why is rotational latency not considered in disk scheduling, Q. Why is rota...

Q. Why is rotational latency typically not considered in disk scheduling? How would you alter SSTF, SCAN and C-SCAN to comprise latency optimization? Answer: Most disks don't

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd