[cs33211] Re: project 2 for Operating Systems

[xdu at cs.kent.edu]

Hi

I have put Grade of Quiz2, Homework2 and Project1. If you have any
question, feel free to ask me.

Thanks
Xiaoxi

>> I had one question on how you want the program to work.  I did a
>> hashing routing to fill the 100 pages into 10 frames originally.
>> Once the memory location is filled, the program tries the hashing
>> routine, and if unsuccessful, it uses a second chance algorithm to
>> find the next usable location.
>>
>> My question is:
>>
>> Did you have a preference for the way the program initially finds
>> the location within memory?  is a hashing algorithm OK?  or should
>> the pages fill sequentially?
>>
>
> There is no specification in the project assignment as to how the
> memory frames are initially filled. So the simpler solution (that is,
> filling them sequentially) would suffice. However, if you implemented
> hashing it is also acceptable.
>
> Thanks,
> --
> Mikhail
> _______________________________________________
> cs33211 mailing list
> cs33211 at cs.kent.edu
> https://listmail.cs.kent.edu/mailman/listinfo/cs33211
>