Xeon as a worthwhile platform?

Niels Möller nisse@lysator.liu.se
11 Apr 2003 12:32:50 +0200

Torbjorn Granlund <tege@swox.com> writes:

>   At what length do faster-than-O(n^2) multiples kick in?
> For the Opteron with the yet-to-be-written assembly code?
> My tea leaves haven't told me that.

But whatever the right cutoff point turns out to be, most of the cpu
time will be spent doing the "small" base case multiplications, right?

So while the algorithm determines the exponent in the expression for
the assymptotic running time, the speed of the base case is what
determines the constants.