当前位置：首页
> Luz 第5974页
Luz 管理员
暂无介绍
89860 篇文章 33 次评论单选题：According to temporal (time) locality, processes are likely to r
According to temporal (time) locality, processes are likely to reference pages that ________.@[B](1)A. have been preloa…
单选题：With the FIFO page replacement policy, and enough space for stor
With the FIFO page replacement policy, and enough space for storing 3 page frames,the memory page reference string ‘1,2,…
单选题：The fundamental basis for virtual memory management is _____ .
The fundamental basis for virtual memory management is _____ .@[B](1)A. virtuality B. locality C. globality D. d…
单选题：Which method can solve thrashing problem?
Which method can solve thrashing problem? @[B](1) A. Add fast disksB. Add more memoryC. Add TLBD. Add fast c…
单选题：In order for a virtual memory management performing well, it is
In order for a virtual memory management performing well, it is preferred that___.@[D](1)A. processes do not have too…
单选题：With demand paging, __________ have worst system performance.
With demand paging, __________ have worst system performance. @[C](1)A. stacks B. lists C. hash tables D. arraysA…
单选题：With demand paging, __________ have best system performance.
With demand paging, __________ have best system performance.@[A](1)A. stacks B. lists C. hash tables D. arraysA.st…
单选题：Which of the following factors prefer larger page size?
Which of the following factors prefer larger page size? @[B](1)A. internal fragmentationB. localityC. the time to rea…
单选题：Consider a system with a memory-access time of 100 nanoseconds a
Consider a system with a memory-access time of 100 nanoseconds and an average page-fault service time of 25 milliseconds…
单选题：With the demand paging, __________ has best system performance.
With the demand paging, __________ has best system performance. @[A](1)A. stacksB. listsC. hashed tablesD. arraysA.s…