Reading discrete set of pages from a disk at one go?

You are going to need something like Page replacement algorithm with prefetch... You didn't tell us how will you operate with pages, how long you will need them in memory etc. But I suppose you will have to solve the situation when the memory is full and you need to release some of the pages from the memory. Look at the algorithms mentioned ( LRU MRU etc.). It is what OS's use for swapping You could also consider to use OS's memory mapped files they have page replacement algorithms already implemented, but don't now about prefetch.

(well depends on OS, I suppose linux will be much more advanced than windows in this topic). You can save a lot of work this way but it might not be perfetcly optimized for your case Regarding disk access optimizations... try to read some theory how OSes do it... Look at disk scheduling algorithms like SCAN or C-SCAN eg at this link.

You are going to need something like Page replacement algorithm... with prefetch... You didn't tell us how will you operate with pages, how long you will need them in memory etc. But I suppose you will have to solve the situation when the memory is full and you need to release some of the pages from the memory. Look at the algorithms mentioned (LRU, MRU etc.). It is what OS's use for swapping.

You could also consider to use OS's memory mapped files - they have page replacement algorithms already implemented, but don't now about prefetch.(well depends on OS, I suppose linux will be much more advanced than windows in this topic). You can save a lot of work this way but it might not be perfetcly optimized for your case. Regarding disk access optimizations... try to read some theory how OSes do it... Look at disk scheduling algorithms like SCAN or C-SCAN, eg. At this link.

Yes I am using a clock replacement algorithm in the buffer pool where the pages will go into. But how do I read the discreet pages into them, minimizing disk access? – swanar Jul 23 at 20:28 OS also solves this (theoretically) - when having multiple disk read request, it should sort them to have optimal disk read order.

But it also depends on how long the disk reads can be deferred to wait for other requests. – Tomas T. Jul 23 at 21:10 1 Try to read some theory how OSes do it... Look at disk scheduling algorithms like SCAN or C-SCAN, eg. Here: ecs.victoria.ac.

Nz/twiki/pub/Courses/COMP305_2009T1/… – Tomas T. Jul 23 at 21:17 updated my answer – Tomas T. Jul 23 at 21:20 That would surely be helpful!

Thanks a lot! – swanar Jul 23 at 21:26.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.