Memory - LeFreq/Singularity GitHub Wiki

Memory in Operating Systems tends to scale exponentially, while used in a logarithmic fashion: larger amounts of memory get allocated, but used more infrequently. Given this, we expect a fractal hierarchy of memory architecture. Ideally, perhaps, the most scaleable and general architecture doubles at each level, so that we might have:

  • 2 working operands,
  • 4 CPU registers,
  • 8 memory-mapped i/o vectors (where your keyboard, mouse buffer can be collected),
  • 16 process table entries,
  • 32 file handles,
  • 64 network sockets,
  • 128 words holding different parts of our object file system,
  • 256 different objects,
  • 512 command history,
  • 1k (BLOCK_SIZE) onboard block static RAM for I/O transfers,
  • 2k XXM static RAM cache,
  • 4k objects
  • 8K applications
  • 16K conglomerates
---
  • 1Gb,
  • 1 Tb of peer storage,
  • 1Pb of data base access,
  • 1Exabyte network storage for every object and data from the whole network.
Something like that...
⚠️ **GitHub.com Fallback** ⚠️