Recall that demand paging is when we bring a page into memory when it is accessed, and prefetching brings extra pages into memory according to some policy. An example of a prefetching policy is when we need page P, we also bring in pages P+1 and P+2 into memory since they are likely to be accessed as well.
When traversing a large linked list , which prefetching policy is most likely to improve performance by reducing page faults?

Question

Recall that demand paging is when we bring a page into memory when it is accessed, and prefetching brings extra pages into memory according to some policy. An example of a prefetching policy is when we need page P, we also bring in pages P+1 and P+2 into memory since they are likely to be accessed as well. 
 When traversing a large  linked list , which prefetching policy is most likely to improve performance by reducing page faults?

Answer

Demand paging with no prefetching, as the nodes of the linked list are dynamically located and could be located anywhere in virtual memory, not necessarily at nearby virtual memory addresses.

Answer

As in the question, prefetching the next few pages (i.e., pages P+1, P+2, ... P+k for some positive integer k), as accessing nodes in a linked list are always allocated contiguously in memory.

Answer

Prefetching page P*sizeof(Node) when page P is requested as the node on page P will always point to a node on this page in memory (if the next pointer is not null).

Answer

Prefetching page 2*P and page 2*P+1 when page P is requested as the node on page P will always point to a node on either of these pages in memory (if the next pointer is not null).

Crowdly

Recall that demand paging is when we bring a page into memory when it is accesse...

Want instant access to all verified answers on moodle31.upei.ca?