From: Godmar Back (gback@cs.utah.edu)
Date: Tue Oct 20 1998 - 00:48:37 EDT
Okay, after a bit more testing I checked it in.
I still haven't tested object with more than 32 refs (or refs
after the thirty-second slot) and I also haven't tested m68k and
friends. Let me know what's breaking.
The speed improvements for doing things like, say recompiling
its own class libraries, are dramatic. For instance, on an elderly
200 MHz PPro/64MB, without any -m switches, the library compile
spends 74 instead of 121 seconds in user land (out of a total
run time of 106 vs. 150).
When given the switches we normally give (-mx 64M -ms 8M),
it spends 42 instead of 60 seconds in user land out of a total of
79 and 99.
Of course, those are not scientific benchmarks... but I think
it shows the tremendous impact of avoiding the hash table
implementation. Along these lines, a student here at Utah
is working on improving the pointer lookup scheme.
A second possible avenue for improvement is to get rid of the
colocation of page headers and pages since this is prone to
cache conflict misses.
- Godmar
This archive was generated by hypermail 2b29 : Sat Sep 23 2000 - 19:57:01 EDT