Ask your own question, for FREE!
Computer Science 21 Online
OpenStudy (anonymous):

How do I figure out how many pages of each page size exist? Page size: 512, 1024, 2048 (words) Number of frames allocated to the process: 4, 8, 12 There is a list of 3001 memory addresses that need to happen, but I can't really start until I figure out how many total page numbers exist.

OpenStudy (anonymous):

i thot page size is fixed for a system.....is it not?

OpenStudy (anonymous):

and wat do u mean by 3001? the memory size is 3001?

OpenStudy (anonymous):

yeah it's like the range of those addresses...........so i think u can get a lower bound on the size of memory

OpenStudy (anonymous):

and u got to repeat this thing with each page size............. so consider the 512 size case....

OpenStudy (anonymous):

um i wonder if u need the total number of pages.............like say the max mem address is round 90000 and memory size occurs in powers of two(generally....well u can allot any size to a vm) and say u fix the size of page to be 512..........so the number of pages depends on the size of memory u give and if u want a page fault sitaution i think u should give a memory less than that like 90000 so there should some swaps and stuff........so it depends on the memory u give to this virtual machine?

OpenStudy (anonymous):

no i meant some thing like faar less than the range of the memory addresses............u want to observe the demand paging concept r8..........so if u give enough memory there would be no page fault? so..........so no virtualisation?

OpenStudy (anonymous):

i was thinking something like there are 24 frames in total........so like if memory size is like 24*512*sizeof(word).......there would be no page fault? so smthin like 60-70% of that size? that's wat i was thinking.....and i dont might do if u are not allowed to make up the amount of memory

OpenStudy (anonymous):

*dont kno wat u might

OpenStudy (anonymous):

I see what you're saying but I'm pretty sure it's not allowed. However, there are only 4 frames for one problem, 8 for the next, and 12 for the next. So, with the entire range of memory from that list of memory locations you would have enough memory but the frames would be allocated so you can't use it all which would give us page faults. I think that's the correct solution.

OpenStudy (anonymous):

ok may be.......... i think u shud check it out.........

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!