/SparseAddressSpace

A datastructure for efficiently simulating a (potentially unlimited) address space.

Primary LanguageC++MIT LicenseMIT

SparseAddressSpace

A C++ datastructure for simulating a sparse address space, suitable for use in compute system simulators.

Todo:

  • Interval tree
  • Coalescing
  • New segments/minimum segment size

How does it work?

"abc" "abc" "abc" "abc"

Usecase: Processor simulator

Todo:

  • initialization memory