Главная
Study mode:
on
1
Introduction
2
When to Choose
3
Possible Speed
4
How it Works
5
Rehashing
6
Memory Map
7
Quiz
8
General Rules
9
Implications of General Rules
10
Moving Records
11
Performance
12
Theory vs Practice
13
DRAM vs SSD
14
Results
15
Comments
16
Computational Storage
17
Patents
18
Virtual Machine Overhead
19
Ubuntu Native Overhead
20
Random Access
21
Security
Description:
Learn about the challenges and opportunities in developing hash tables optimized for persistent memory in this 47-minute technical talk from the Storage Developer Conference 2022. Explore how persistent memory bridges the gap between traditional in-memory and database applications, requiring new programming approaches that consider both CPU processing efficiency and storage access patterns. Discover why operations that take hundreds of nanoseconds in persistent memory - equivalent to about 1000 CPU instructions - demand careful consideration of algorithmic efficiency, virtual memory mechanisms, and system call overhead. Examine key design constraints including avoiding random access to large arrays, optimizing hash code calculations, and minimizing context switches in critical paths. Through the lens of heterogeneous hash table implementation, gain practical insights into performance optimization techniques, computational storage considerations, and the implications of virtual machine overhead. Compare DRAM versus SSD performance characteristics while understanding security considerations and general rules for effective persistent memory programming. Read more

Challenges and Opportunities in Hash Table Optimization for Persistent Memory

SNIAVideo
Add to list