Mail Archives: djgpp/1995/01/30/14:17:49
In general, djgpp uses a round-robin pageout. This means that there
is no overhead, but it's less efficient than LRU. I think someone
tried to put LRU in once, but it doesn't seem to be in there now.
Unless your program's working set is larger than physical memory,
eventually everything you use will be in physical memory. Each new
page touched (new mallocs, for example) cause some OTHER page to be
swapped out so that there is physical memory for the new data.
Memory that becomes unused will eventually be paged out, but malloc
will also reuse that memory for new requests.
- Raw text -