4 ms·

For the programmer who works with far more pedestrian hardware what does someone do with 2TB of ram that you wouldn't implement in lets say a rainbow table on a

• dekhn 11y ago
  Sure (I'm not sure what rainbow tables have to do with this; those are typically for a very specific use. Bloom filters seem to be a better choice; they allow for fixed-memory hashmaps with known false positive rates). I had a large multidimensional object and I wanted to smooth it. So, I loaded the whole object in RAM, did an FFT on it, multiplied it by a gaussian, then did an inverse FFT on it. Another example would be storing very large hashmaps (as a backing store for a sparse multidimensional array). If you had a very large biosequence database, and you wanted to map next-generation reads against it, you'd load the database into RAM with an mmap call followed by a block read, then subsequent mappings would be very fast. Effectively, having large amounts of flat access RAM means you don't have to worry about communication (between nodes, or between node and disk).