This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: nanoseconds? Problem 2: Consider the two-dimensional array A: int A = new int ; where A is at location 200, in a paged system with pages of size 200. A small process is in page 0 (locations 0 to 199) for manipulating the matrix; thus, every instruction fetch will be from page 0. For three page frames, how many page faults are generated by the following array-initialization loops, using LRU replacement, and assuming page frame 1 has the process in it, and the other two are initially empty: a. for (int j = 0; j < 100; j++) for (int i = 0; i < 100; i++) A[i][j] = 0; b. for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) A[i][j] = 0; Problem 3 : C hapter 3, Problem 10 Problem 4 : C hapter 3, Problem 24 Suppose that a page-fault occurs after the 8 th clock tick. Which frame will be selected to bring the new page in memory? Problem 5 : C hapter 3, Problem 25 Problem 5 : C hapter 3, Problem 26 Problem 6 : C hapter 3, Problem 28...
View Full Document
- Fall '08
- Operating Systems, Virtual memory, main memory, page table, Paging