🚀 go-pugleaf

In article <168@csinc.UUCP> rpeglar@csinc.UUCP (Rob Peglar) writes:
>In summary, there are lots of codes that could be "scaled" (e.g. finer
>grids) to consume just about any D-space feasible today.  If the
>vendors want a piece of that action, >32 bits of D-space is necessary.
>Not to mention issues like memory bandwidth, I/O rates, etc.  1/2 :-)

Arn't these typically compute bound problems also?  Doesn't this mean
supercomputers?  Isn't this discussion about high volume microprocessors?

I don't remember who it was that presented the argument based on the
length of time taken to zero, let alone process 4G, but this looks like
a valid line of reasoning.  Just how many MIPS does it take before you
can process a 4G space in less than a week.  I think we're a still far
from that point.

Gerry Gleason