following logical addresses?Рa. 0,430Рb. 1,10Рc. 2,500Рd. 3,400Рe. 4,112Р10.2 Assume that you have a page reference string for a process with m frames (initially all empty). The page reference string has length p with n distinct page numbers occur in it. For any page-replacement algorithms,Рa. What is a lower bound on the number of page faults?Рb. What is an upper bound on the number of page faults?Р10.11 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.РHow many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each.РLRU replacementРFIFO replacementРOptimal replacement
全文预览
