It's UWAweek 42 (2nd semester, week 12)

help2002

This forum is provided to promote discussion amongst students enrolled in CITS2002 Systems Programming.
Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.
Displaying selected article
Showing 1 of 738 articles.
Currently 178 other people reading this forum.


 UWA week 41 (2nd semester, week 11) ↓
SVG not supported

Login to reply

👍?
helpful
6:34am Thu 10th Oct, Joshua N.

ANONYMOUS wrote:
> This input is on the project sheet [0 2 1 3 3 2 2 0 2 1 0 2 3 0] > > at t=7, the RAM should look like this right? > [0₀ 2₀ 1₀ 3₀ 3₁ 2₁ 2₂ 0₁] > > then at t=13 the RAM would look like this right, since local LRU means that the next page replaces its previous page? > [0₂ 2₃ 1₁ 3₂ 3₁ 2₀ 2₂ 0₃]
Yes.
> Im not so clear on how out.txt should look like. The first 4 lines has to be the process page tables right? and then a fifth line shows the RAM content at the end (in this case at t=13)?
Yes.
>So the out.txt of the example above should look like this? For the RAM content is it process, page, time stamp; or page, process, time stamp; ? > > 99, 99, 0, 7 > 99, 2, 99, 99 > 5, 99, 6, 1 > 99, 4, 3, 99 > 2,0,10;2,0,10;3,2,8;3,2,8;1,1,9;1,1,9;1,3,4;1,3,4;0,2,11;0,2,11;2,2,6;2,2,6;3,0,13;3,0,13;
I believe it follows the same order as the struct, which is process;page;last access time.
> and another thing - if all processes has at least 1 page in the RAM by t=7 then the RAM will always look that way right? as in that only page numbers will change from that point onwards?
Yes, since we are using local LRU.

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy