G
glen herrmannsfeldt
Guest
Thomas Womack <twomack@chiark.greenend.org.uk> wrote:
(snip, someone wrote)
up at the top of the list.
-- glen
(snip, someone wrote)
It has been done on SSE, Google for 699 Rognes Seeberg and it comesI don't follow. Why would it take 2000 FPGAs to do what you can do
with 100 PCs?
10^18 per day = 10^13 per second = 10^9.7 per FPGA-second, according
to the figures he's using. Which might be a 100MHz FPGA clock and 80
units on the FPGA, or 25MHz and 300 units.
The PCs are 2.5GHz quad-cores, so there's the factor 100; SSE gets you
sixteen units rather than eighty, but the much faster clocks make up
for it.
up at the top of the list.
Conveniently my problem has no multiplies in it.(this is the problem I run into whenever considering how to do
number-theory really fast on FPGAs: a Spartan 3 has a hundred 17x17
multipliers running at 200MHz, a cheap AMD CPU has four 64x64
multipliers running at 2500MHz and an expensive one has twelve)
-- glen