作業系統›Ch8 虛擬記憶體
第 24 題/共 47 題
◀ OS 24/47
24. Page Table、Hashed Table、Access Time
#OS-08-024中Page TableHashed TableAccess Time
題組題幹(本題:第27題,共 4 小題)點擊展開

Compare Oracle SPARC and ARM in supporting the page table. The former adopts 2-level caching and a hashed table with the feature of span (the number of pages an entry represent), while the latter uses also 2-level caching and a hybrid 1/2-level hierarchical page table (1-level for big pages and 2-level for small pages). Suppose 100 ns for memory access, 10 ns for 2nd cache access with cache hit ratio of 90%, and 1 ns for 1st cache access with cache hit ratio of 60%, and the remaining 10% for table lookup in the memory. Note that the 1st cache is looked up first before the 2nd cache, and then the table in the memory.

In SPARC, if the maximum length of a linked list entry is 4, what is the maximum access time for a desired word in a frame?

📄 交大111
跳轉到第題
▤完整推導請見《WH 資工筆記 · 作業系統》Ch8 虛擬記憶體
本章題號 · 21–40 / 47