Recent questions tagged page-faults

1 1 vote
1 1 answer
1.4k
1.4k views
How this is 20000? the array is in RMO and we are accessing like CMO then for each entry there should be PF.
4 4 votes
1 answers 1 answer
805
805 views
Self doubt:What is the rule or keyb point we should keep in mind while solving problems on LRU page replacement algorithm? Please explain with examples.
1 1 vote
1 answers 1 answer
841
841 views
Could anyone give an example.
3 3 votes
1 1 answer
1.2k
1.2k views
Can anyone explain the answer?
3 3 votes
1 1 answer
3.3k
3.3k views
Consider a virtual memory system running on a RISC CPU. Page tables are not locked in memory and may be swapped to disk. An 1w (load word) instruction reads one data word...
3 3 votes
1 1 answer
1.6k
1.6k views
1 1 vote
0 0 answers
597
597 views
if you have 10 Frames and using LRU how many page fault will be there in both below: for (int j = 0; j < 100; j++) for (int i = 0; i < 100; i++) A[i][j] = A[i][j] + A[j]...
0 0 votes
1 1 answer
1.0k
1.0k views
A page fault(A) is an error specific page.(B) is an access to the page not currently in memory.(C) occur when a page program occur in a page memory.(D) page used in the p...
10 10 votes
2 2 answers
18.2k
18.2k views
I got some doubt while solving previous year questions:-Since While calculating EMAT and question involves page fault service time,we use formulae:-p*s+(1-p)*m ,taken fro...
0 0 votes
1 1 answer
487
487 views
Small doubt,We know that, when a page fault(required page is missing in main memory) occurs, the respective process will be blocked (Process is removed from Main memory. ...
2 2 votes
1 1 answer
5.3k
5.3k views
Consider the following passage to answer questions from Q. Nos. 1 to 6 :Virtual Memory is a technique that allows the execution of processes that maynot be completely in ...
1 1 vote
0 0 answers
861
861 views
Consider the two-dimensional array A$:$int A[ ] [ ] = new int[100][100]; where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process...
1 1 vote
2 answers 2 answers
1.2k
1.2k views
Consider the following information about a hypothetical organization.Assume the cache is physically addressedTLB:hit rate is 95%,access time is 1 cycleCache: hit rate is ...
2 2 votes
2 answers 2 answers
767
767 views
I am getting 11 as pagefault , but the solution says 9. What i am missing?
2 2 votes
0 0 answers
1.7k
1.7k views
A.11B.12C.13D.14Couldn't visualize how counter is assigned and how page is exactly replaced based on counter.Visual representation would be helpful rather than just ans!
2 2 votes
0 0 answers
2.0k
2.0k views
Which of the page replacement algorithm has the property that if we traverse the reference string from start to end or from end to start,the number of page faults will be...
6 6 votes
2 answers 2 answers
3.3k
3.3k views
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory acc...
4 4 votes
1 answers 1 answer
3.8k
3.8k views
1024x1024 array of 32-bit numbers is to be normalized as follows. For each column the largest element is found and all elements of the column are divided by this maximum ...
1 1 vote
2 2 answers
3.2k
3.2k views
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, 6$ Which of the following options, gives the correct number of pag...
0 0 votes
1 1 answer
607
607 views
Considering hierarchical method,is my this equation correct?Assuming tlb access time as 0 nsEMAT = 300 [memory access time] + 0.2*(300*2)[2 level page table] + 0.2 * (500...
0 0 votes
1 1 answer
843
843 views
if i use hierarchical system then the equation : 50 = 10 + 0.3(p*400 + (1-p)*125)... is correct?
3 3 votes
1 answers 1 answer
9.9k
9.9k views
Consider the reference string:0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frame...
1 1 vote
2 2 answers
7.1k
7.1k views
Suppose that the number of instructions executed between page fault is directly proportional to the number of page frames allocated to a program. If the available memory ...
1 1 vote
2 2 answers
2.0k
2.0k views
Match the following $:$$\begin{array}{} \text{(a)} & \text{Dangling pointer} & \text{(i)} & \text{Buffer replacement policy} \\ \text{(b)} & \text{Page fault} & \text{(...
5 5 votes
4 answers 4 answers
10.1k
10.1k views
Determine the number of page faults when references to pages occur in the following order:1, 2, 4, 5, 2, 1, 2, 4Assume that the main memory can accommodate 3 pages and th...
5 5 votes
2 answers 2 answers
3.4k
3.4k views
Belady's anomaly meansPage fault rate is constant even on increasing the number of allocated framesPage fault rate may increase on increasing the number of allocated fram...
0 0 votes
2 answers 2 answers
7.3k
7.3k views
(A) processes tend to the I/O-bound(B) size of pages is reduced(C) processes tend to be CPU-bound(D) locality of reference is applicable to the process
4 4 votes
4 answers 4 answers
4.8k
4.8k views
A page faultOccurs when a program accesses an available page on memoryis an error in a specific pageis a reference to a page belonging to another programoccurs when a pro...
2 2 votes
0 0 answers
1.1k
1.1k views
Consider, 2 level paging , with Process P, Inner page table PTi, and outer page table PTo.Now we know that P and PTi are divided in various pages but PTo is in 1 page on...