help2002

It's UWAweek 30 (2nd semester, week 1)

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 1168 articles.
Currently 6 other people reading this forum.

UWA week 35 (2nd semester, week 6) ↓

Blocked -> Ready (all 6)

12:11pm Mon 28th Aug, Christopher M.

ANONYMOUS wrote:

> So, there can be multiple implementations of this? The way I thought it would be is that if something is in transition between states (and that transition takes some amount of time) it is neither in its current state nor in the place it’s going but rather in some other ‘transition queue’ or something like that. Depending on the implementation will that not change the output for the total time.

There's 'always' multiple ways to implementing something. Different (correct) implementation should produce the same results - as long as a process requests something requiring a state transition at a certain time, and ends up at its eventual destination at the correct time, then 'where' it sits (in implementation) during that period doesn't matter.

> Moreover I checked the sample solutions for a simple commands file, one which after some time sleeps for 6 usecs. In this case the program first went to blocked, did nothing for 10 usec, then left blocked. I thought the 10 usec transition time was independent of the sleep time.

Was the requested sleep time shorter or longer than the timequantum? If the sleep-time was for 6usecs and the timequantum 10usecs, all seems correct.