Главная
Study mode:
on
1
Introduction
2
Linked Lists
3
RB Tree
4
Radix Tree
5
The Problem
6
Results
7
Memory Consumption
8
Radix Tree Problems
9
Node Types
10
API
11
Shortterm plans
12
Longerterm plans
13
File descriptor table
14
Hash tables
15
Open questions
Description:
Explore the innovative Maple Tree data structure for Linux in this 39-minute conference talk by Matthew Wilcox from Oracle. Discover how this efficient index range storage solution outperforms existing rbtree and radix tree structures while offering RCU-safety and optimization for modern CPUs. Learn about the implementation details, API inspired by XArray, and its ease of use compared to rbtree. Gain insights into various node types, memory consumption, and potential applications such as file descriptor tables and hash tables. Understand the short-term and long-term plans for Maple Tree development, and engage with open questions surrounding this promising new data structure in the Linux ecosystem.

The Linux Maple Tree

Linux Foundation
Add to list