Mail Archives: djgpp/1992/05/12/00:06:34
I am not a heavy user of gcc for big jobs, but
did do some experiments to see how the paging
mechanism behaves. I have a tiny program that
builds a balanced binary search tree on-line
from sorted input. My machine is 486/33
210 Mb 18ms IDE, 8Mb XMS. For a tree of final
size ~12 megs, I get real thrashing
as soon as it hits ~8Mb. I.e., to build a
7Mb tree takes ~8 seconds. To build the
12 meg tree takes almost 20 _minutes_ with the
drive light on constantly. This is with either
DOS 5 smartdrv or Hyperdisk at 1.5 megs.
Perhaps at least some of the disk `hang' problems
being reported are such thrashing. I haven't looked
at go32 to see what the replacement strategy is,
but I wouldn't expect this program to give degenerate
behavior with LRU.
Gene
- Raw text -