# Structure of the Page Table ## Single level * 一個logical address space依據page大小切割 * 對應到一個page table(每格4byte = 32bits) * 上面記錄每個page對應到的frame ## Two level * page table 本身也是一個 page table   ## Hashed Page Tables * handling address spaces ≥ 32 bits * hash function collision 的次數等同於 TLB miss 時需要存取記憶體的次數  ## Inverted Page Table * 只用一個page table(所有process共用) * 以physical memory為對象 * 若有m個frame , 則有m個table entries  * 減少記憶體使用量 * 降低了 page table size * 增加搜尋table的時間 * 不適合實作shared memory * 只有一個表格 --- ##### last edit > [name=dot] [time=Sat, Jan 4, 2020 10:38 PM] [HOME PAGE](/bKDZoNkrT9SOBnTvY_aj2Q?edit) :chart_with_upwards_trend: {%hackmd theme-dark %} ###### tags: `OS` `CSIE`
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up