推 kane9988:如果要使overhead最小,則page table大小和內部碎裂加起來 11/01 00:45
→ kane9988:要剛好一個page,好像是在os恐龍裡面看到的 11/01 00:46
→ kane9988:所以假設頁框大小為n,(s/n)*8=n/2 11/01 01:04
→ jim055006:請問K大是在哪一頁看到的.... 11/01 21:00
Consider a computer system with both segmentation and paging. When a segment
is in memory, the space overhead of the segment comes from two sources:
internal fragmentation and page table entries for the segment. Assume
that the segment size is s, and each page table entry occupies 8 bytes.
What page size (in bytes) minimizes such overhead?
這一題要怎麼算啊??
不懂內部碎裂要怎麼假設ㄝ....
有勞高手指點一下~~
鋼溫!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 223.139.197.100