335 views
1 votes
1 votes
Is belady's anomaly will be seen in every reference string for fifo page replacement or it is seen for some reference string only?

2 Answers

1 votes
1 votes
Belady's anomaly will be seen in some reference string for FIFO page replacement  only.
0 votes
0 votes
For a given string length n there might be a possible arrangement for which FIFO suffer from belady anomaly, which is also depend on the number of frames we use.

In overall it a that only in some cases that too for some permutations of the page requested.

Related questions

642
views
0 answers
0 votes
arya_stark asked Oct 18, 2018
642 views
Consider two possible page-replacement strategies: LRU (the least recently used page is replaced) and FIFO (the page that has been in memory longest ... (D) None of thesehttps://www.techtud.com/example/page-replacement-algorithms
1.4k
views
2 answers
2 votes
Parshu gate asked Nov 11, 2017
1,359 views
Given the following stream of page references by an application, calculate the number of page faults the application would incur with the FIFO page replacement algorithms. Assume that all pages are ... : A B C D A B E A B C D E B A B
568
views
2 answers
1 votes
priti sharma asked Oct 14, 2015
568 views
Is it always true that FIFO  will suffer from Belady Anamoly when i increase the frame number allocate from k to k + 1 .or it depends upon the reference string also ?
134
views
0 answers
1 votes
Reetu Chaudhary asked May 6
134 views
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory ... a) 9 and 7(b) 7 and 9(c) 10 and 12(d) 6 and 7