An Efficient and Safe B+ Tree for Virtual Memory Management

Key Points

• Implemented a B+ tree structure, achieving improved performance in search and insertion when compared to traditional AVL trees.
• Experiment results indicate enhanced search and insertion performance, outperforming AVL trees in high-demand computational tasks.
• Proposed data structure provides a reliable method for managing virtual memory, with applicability to high-performance computing (HPC) environments.
• Focus on future evaluations in concurrent settings highlights the potential for further advancements in memory management techniques.

Abstract