An Efficient and Safe B+ Tree for Virtual Memory Management
João Vítor V. Coelho, Samuel Xavier‐de‐Souza, Wedson Almeida Filho · 2025
In high computational demand environments, the efficient management of disjoint intervals poses a challenge for traditional data structures. This research proposes a B+-tree based data structure, inspired by Linux kernel solutions. Preliminary experiments demonstrate better search and insertion performance compared to AVL trees. The solution aims to optimize virtual memory management and has potential for improve HPC workloads, with future plans for evaluation in concurrent environments and high-performance hardware.