Subject
Computer Science
Topic
Computer Fundamental
Paging mainly avoids which memory-allocation problem associated with variable-sized contiguous blocks?
Paging mainly avoids which memory-allocation problem associated with variable-sized contiguous blocks?
a)
External fragmentationb)
Internal fragmentationc)
Cache missesd)
TLB missesExplanation
Because pages and frames are fixed-size, physical allocation does not require contiguous variable-sized free blocks.Related questions
Which component normally has the lowest access latency in the memory hierarchy?Which order correctly represents the memory hierarchy from fastest to slower storage?As we move downward from registers toward secondary storage, memory capacity generally:As we move upward toward CPU registers in the memory hierarchy, cost per bit generally:Which memory level is designed to bridge the speed gap between the CPU and main memory?Which principle explains why recently accessed data is likely to be accessed again soon?Which principle states that memory locations near a recently accessed location are likely to be accessed soon?Why does a memory hierarchy improve overall system performance?