help2002

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 the 4 articles in this topic

Showing 4 of 738 articles.
Currently 8 other people reading this forum.

UWA week 40 (2nd semester, week 10) ↓

2nd project Bringing in the next page of a process if all pages are already in RAM (all 5)

10:00pm Sat 5th Oct, Sean G.

Hey, I'm also not sure what to do in this case. Say the input string was 0 0 0 0 0 0 0 0. Do we load process 0 into RAM twice, and effectively load its 4 pages twice? Or should allow a process to be completely loaded into RAM only once?

UWA week 41 (2nd semester, week 11) ↓

2nd project Bringing in the next page of a process if all pages are already in RAM (all 5)

1:35pm Mon 7th Oct, Joshua N.

ANONYMOUS wrote:

> Hello, > > I've seen a few posts already saying that if the input file tells us to bring the next page of process 0 to RAM, but all pages of process 0 are already in RAM, then we should update the last_accessed time of the 0th page of process 0 to the new time step. > > But I believe the unit coordinator said in a tutorial that if all pages of process 0 are already in RAM, then we should do nothing. > > So I'm just wondering which one is correct? > > Thanks

If Amitava said to only do it once then follow what he said.

2nd project Bringing in the next page of a process if all pages are already in RAM (all 5)

1:07pm Wed 9th Oct, Samay G.

But we will have to change the time step of the page which is already there and also been requested next. otherwise we will not be able to know the least recently one

2nd project Bringing in the next page of a process if all pages are already in RAM (all 5)

4:43pm Wed 9th Oct, Joshua N.

"Samay Gupta" <23*6*5*8@s*u*e*t*u*a*e*u*a*> wrote:

> But we will have to change the time step of the page which is already there and also been requested next. otherwise we will not be able to know the least recently one

Yes, if you're assuming you can load the same process twice.