Please copy and paste a figure of x86 paging structure (from text book or lecture slides or internet). Please explain in details (two to three paragraphs with example numbers) about how an address of a program is translated into a physical memory address using the paging structure. (Please do not copy paste complete answers from your classmate or internet.)
Example : Base register = 300040 limit register = 120900 then legal address = (300040+120900)= 420940(inclusive). legal address = base register+ limit register
Process resides in disk in form of binary executable file therefore to execute process it should reside in main memory.
Process is moved from disk to memory based on memory management in use and the processes waits in disk in form of ready queue to acquire memory.
The virtual address is explored in the virtual page number and the page offset, which(page offset) is passed through as it is not translated.
The virtual page number is shaped up in the TLB, looking for a tag with the corresponding number.
There is an input in the TLB (hit), which says that we immediately can translate the virtual to the physical address.
Get Answers For Free
Most questions answered within 1 hours.