I once speculated to a friend about 15 years ago that eventually solid state storage space would be so fast that it could serve as active memory. I can’t wait to tell him.
I once speculated to a friend about 15 years ago that eventually solid state storage space would be so fast that it could serve as active memory. I can’t wait to tell him.
My initial thought was that everything would be stored in triplicate, then read in triplicate and ‘voted’ to the correct value, but I guess even that only extends the time before random bit-flips make the data unreadable. You’re probably right on the need for active error checking if there is an intention to store anything long-term in this manner.
TMR (so the tripilicate method) wouldn’t be super suitable for this kind of application since it is a bit overkill in terms of redundancy. Just from an information theory perspective, you should only have enough parity suitable for the amount of corruption you are expecting (in this case, not a lot, maybe a handful of bits after a year or two). TMR is optimal for when you are expecting the whole result to be wrong or right, not just corrupted. ECC and periodic scrubbing should be suitable for this. That is what is done by space-grade processors and RAM.