A widely used example is mprime - the mersenne prime finding program (
http://www.mersenne.org/ ). This typically uses 8 or more MBytes of
RAM which it completely thrashes.
The program is written in very efficient assembler code and has been
designed not to thrash the TLB as much as possible, but with a working
set of > 8 MBs (which is iterated through many times a second at
maximum memory bandwith) large pages would make a real improvement to
it. Since each run takes weeks any improvement would be eagerly
snatched at by the 1000s of people running this program ;-)
If there was some hack where 4MB pages could be allocated for
applications like this then I'd be very happy!
-- Nick Craig-Wood ncw@axis.demon.co.uk - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/