If the memory access time is denoted by ‚Äö√Ñ√∂‚àö√ë‚àö‚â§ma‚Äö√Ñ√∂‚àö√ë‚àö¬• and ‚Äö√Ñ√∂‚àö√ë‚àö‚â§p‚Äö√Ñ√∂‚àö√ë‚àö¬• is the probability of a page fault (0

p x ma + (1-p) x page fault time

(1-p) x ma + p x page fault time

If the memory access time is denoted by ‚Äö√Ñ√∂‚àö√ë

1.	If the memory access time is denoted by ‚Äö√Ñ√∂‚àö√ë‚àö‚â§ma‚Äö√Ñ√∂‚àö√ë‚àö¬• and ‚Äö√Ñ√∂‚àö√ë‚àö‚â§p‚Äö√Ñ√∂‚àö√ë‚àö¬• is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is :$
A.	p x ma + (1-p) x page fault time
B.	ma + page fault time
C.	(1-p) x ma + p x page fault time
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

No Comment Found

Related MCQs

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1Let a computer system has main memory size of 3 page frames which are initially empty and it is running on demand paged virtual memory system. The number of page faults under LRU and FIFO page replacement policy are respectively:
In which one of the following page replacement policies, Belady's anomaly may occur?
A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 50 distinct pages in some order and then accesses the same 50 pages in reverse order. How many page faults will occur?
How many page faults occur in a system with LRU page replacement policy having 3 (initially empty) page frames for the following string of page reference - 5, 1, 2, 3, 4, 3, 2, 3, 1, 2, 4, 3?
Dirty bit for a page in a page table
Consider the following page reference string.1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6What are the minimum number of frames required to get a single page fault for the above sequence assuming LRU replacement strategy?
A computer has sixteen pages of virtual address space but the size of main memory is only four frames. Initially the memory is empty. A program references the virtual pages in the order of 0, 2, 4, 5, 2, 4, 3, 11, 2, 10. How many page faults occur if LRU page replacement algorithm is used?
Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used)
A virtual memory system uses FIFO page replacement policy and allocates a fixed number of frames to the process. Consider the following statementsM : Increasing the number of page frames allocated to a process sometimes increases the page fault rateN : Some programs do not exhibit locality of referenceWhich one of the following is true?
Determine the number of page faults when references to pages occur is the order – 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page 1 having brought earlier than page 2. (assume LRU i.e. Least-Recently-Used algorithm is applied)

Discussion

No Comment Found

Related MCQs

Reply to Comment