Although we'd all like Moore's Law to continue forever, quantum mechanics imposes some
fundamental limits on the computation rate and information capacity of any physical device. In
particular, it has been shown that 1 kilogram of matter confined to 1 liter of space can perform at most
10^51 operations per second on at most 1031 bits of information [see Seth Lloyd, "Ultimate physical
limits to computation." Nature 406, 1047-1054 (2000)]. A fully-populated 128-bit storage pool would
contain 2^128 blocks = 2^137 bytes = 2140 bits; therefore the minimum mass required to hold the bits
would be (2^140 bits) / (10^31 bits/kg) = 136 billion kg.
That's a lot of gear.
To operate at the 10^31 bits/kg limit, however, the entire mass of the computer must be in the form of
pure energy. By E=mc^2, the rest energy of 136 billion kg is 1.2x10^28 J. The mass of the oceans is
about 1.4x10^21 kg. It takes about 4,000 J to raise the temperature of 1 kg of water by 1 degree
Celcius, and thus about 400,000 J to heat 1 kg of water from freezing to boiling. The latent heat of
vaporization adds another 2 million J/kg. Thus the energy required to boil the oceans is about
2.4x10^6 J/kg * 1.4x10^21 kg = 3.4x1^027 J. Thus, fully populating a 128-bit storage pool would,
literally, require more energy than boiling the oceans.I think there is more utility in 128-bit ALUs than 128-bit pointers, as a practical matter.
Still, I don't think anyone nowadays would settle for a non-power-of-2 machine word size, even if just for backwards compatibility and even if a pointer is limited to e.g. 72 bits out of all 128. If that is the case, then another use could be a "fat pointer" that was proposed somewhere in the C world to avoid passing raw pointers without their lengths.You could pass a length of an array along with its address as long as the length of your array can fit in e.g. 56 bits, which would be enough for most use cases if we feel like going into the "640kB is enough for everyone" route again.
So far I never used mmap (no usecase that pushed me to find alternatives for the usual open&seek), but I was always curious about it.
Your statement made me search & find this ( https://unix.stackexchange.com/questions/474926/how-does-mem... ) => interesting.
Thanks :)
https://stackoverflow.com/questions/45972/mmap-vs-reading-bl...
That said, how to you make your calculation about DNA's information density? Without counting water, I've arrived at 720g for one “mole of bits”, which is a bunch of orders of magnitude higher than your figure: 2 amino-acids (262g/mole) [1], 2 Deoxyribose (135g/mole each) and 2 Phosphate (94g/mole each).
[1]: and it's the same value be it A-T or G-C, that's interesting
[1] https://www.scientificamerican.com/article/dna-the-ultimate-...
I do not know why Laremere chose 85.8 grams though as these are quite above the 64 bit limit, unless I got my multiplications wrong :P
"The male nuclear diploid genome extends for 6.27 Gigabase pairs (Gbp), is 205.00 cm (cm) long and weighs 6.41 picograms (pg)."
Or, many many orders of magnitude less than 85 grams...
If they could get a system with the full 64-bits of addressable RAM, they'd likely have gone even bigger.
It looks like the Fugaku ARM cluster with 158,000 nodes uses < 5 PiB for 40 MW.
As an aside, man does reading something from @sgi.com on USENET take me back to a better time. Title should probably note [1995]
[0] https://www.fujitsu.com/global/about/innovation/fugaku/speci...
[1] Also https://arxiv.org/abs/quant-ph/9908043 "Ultimate physical limits to computation"