Files
2025-02-22 16:27:36 +00:00

42 lines
1.5 KiB
Org Mode

* Future work
This documents is decision making to highlight
potential paths to take for this PhD.
We will initially talk about the current expirement
which is a FAT pointer based memory allocator
and will then expand into 2 potential paths:
- Cheri RISCV to prevent using the TLB.
- Allocator evaluation based on stripping instruction
calls for larger allocators like Jemalloc.
** Current expirement: FAT pointer based range addresses
- TODO add diagram
The objective of this expirement was to ensure we can use the CHERI bounds as
tracking mechanism of allocations instead of using multiple TLB entries. Using
this approach we can use a single Huge page entry with bounds to ensure that
the bounds (Which is the top and base address) can be extracted from the
pointer using the Cheri compressed bounds mechanism. We implemented a simple
allocator which uses this technique with a basic malloc and free.
*** Objectives (Todo steal research questions from the paper)
- Reduce the number of TLB walks (Reducing each transaltion to 2 CPU CYCLES with huge pages).
- Using a block based style allocations inside huge pages.
*** Hardware
- ARM morello (Huge page size 1GB used)
*** Evaluation (Steal evaluation from the paper)
*** limitation
- Using Huge page still requires a TLB entry which could be mitigated
(Refer to the FPGA work).
- ARMv8 only supports using to virtual addresses so it's required to
bypass the TLB for address translation.
** Cheri RISCV to prevent using the TLB