adplus-dvertising
frame-decoration

Question

Data structure, maintaining the addresses of physical-pages, typically takes the form of a

a.

Page size

b.

Page table

c.

Queue

d.

Stack

Posted under Computer Architecture

Answer: (b).Page table

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Data structure, maintaining the addresses of physical-pages, typically takes the form of a

Similar Questions

Discover Related MCQs

Q. The matching tag sends the corresponding physical address through effectively a

Q. For Reducing Miss Rate, using Large blocks', the given statement defines

Q. Equivalent to the PTE valid bit, used to indicate the valid translation is refered to as

Q. When the processor gets the requested data items from the cache, it is called a

Q. To provide for protected sharing, half of the address space is shared by all processes and half is unique to each process, called

Q. The processor's performance can be calculated as

Q. At any instant it is possible to switch from one process to another, this exchange is called a

Q. Caches containing either instructions or data, is referred to the term

Q. Hardware solutions for the synonym problems, are called

Q. Fixed-size blocks known as pages, and those having variable-size blocks are known as

Q. If the entry is 8 bytes long, each page table has 512 entries, and the Opteron has 4 KB pages. Each of the four level fields are 9 bits long, and the page offset is 12 bits, then the sign extended would be

Q. If going fully associative, refers to the

Q. The natural policy uses for the memory hierarchies: L1 data of cache are always present in L2 level of cache, refers to

Q. For reducing the chance of throwing the information which soon will be needed, this technique used is

Q. The ratio of cache accesses, results in a miss is known as

Q. AMD64 requires that the upper 16 bits of the virtual address be just the sign extension of the lower 48 bits, which it calls

Q. Larger cache-size, larger block-size, and higher associativity, refers to the

Q. A small page size will result in less wasted storage when a contiguous region of virtualmemory is not equal in size to a multiple of the page size, this unused memory is known as

Q. To help the operating system estimate LRU, many processors provide a

Q. The policy for memory hierarchies: L1 data are never found in an L2 cache, refers to