Persistent Hash Map Persistent Transactional Data Structures Live Demonstration ReferencesIntroduction Persistent Hash Map Persistent Transactional Data Structures Live Demonstration References Overview Introduction Data Structures Design Goals Methodology Performance Results Live Demonstration A Persistent Hash Map for Graph Processing Workloads and a Methodology for Persistent Transactional Data Structures 2In 2IntroductionIntroduction Persistent Hash Map Persistent Transactional Data Structures Live Demonstration References Introduction Persistent Memory ▶ Persistent Memory is positioned as a new tier in the

search is now O (log N)! Awesome!!!Problems (Not really, more like caveats …) Like all tree data structures, not really cache friendly. ● Can always represent the tree as a heap but you still jump around

List-like data structures std::vector std::list std::dequestd::vector C++ version of the array-list data structure Backed by a C-style array Automatically allocates a new backing array when inserting

supercomputer? Introduce PGAS Model, RDMA Building Remote Pointer Types Building Distributed Data Structures Extending to GPUsThis Talk Background: how do we write a program for a supercomputer? Introduce Introduce PGAS Model, RDMA Building Remote Pointer Types Building Distributed Data Structures Extending to GPUsThis Talk Background: how do we write a program for a supercomputer? Introduce PGAS Model Model, RDMA Building Remote Pointer Types Building Distributed Data Structures Extending to GPUsThis Talk Background: how do we write a program for a supercomputer? Introduce PGAS Model, RDMA Building

0 GPU Tile 1 Tile 0 Xe LinkProject Goals - Offer high-level, standard C++ distributed data structures - Support distributed algorithms - Achieve high performance for both multi-GPU, NUMA, and (Ranges, Parallelism, Distributed Data Structures) - Distributed Ranges (Concepts) - Implementation (Algorithms and views) - Complex Data Structures (Dense and sparse matrices) - Lessons (Ranges, Parallelism, Distributed Data Structures) - Distributed Ranges (Concepts) - Implementation (Algorithms and views) - Complex Data Structures (Dense and sparse matrices) - Lessons

Stack/Queue Live Demonstration Design and Implementation of Highly Scalable Quantifiable Data Structures in C++ 2MotivationMotivation Quantifiability Vector Space Entropy Measurement Design and Implementation of atoms in the universe is 1082 Design and Implementation of Highly Scalable Quantifiable Data Structures in C++ 4Motivation Quantifiability Vector Space Entropy Measurement Design and Implementation of takes effect in real-time order. Design and Implementation of Highly Scalable Quantifiable Data Structures in C++ 5Motivation Quantifiability Vector Space Entropy Measurement Design and Implementation of

distribution. Ben, PhD Candidate at UC Berkeley Data structures and algorithms for parallel programs. Working on C++ library of distributed data structures. Please hire me! About Us 2 Scott, Principal This Talk Background: How and why to use matrix algebra for graphs? What are the important data structures and concepts? Prior work in the GraphBLAS community, C API Overview of our draft C++ API How This Talk Background: How and why to use matrix algebra for graphs? What are the important data structures and concepts? Prior work in the GraphBLAS community, C API Overview of our draft C++ API How

notice it. Things that build on composability of Things that build on composability of bool bool:: control �ow: almost all algorithms and loops, reallybool bool UNDERLIES SO MUCH UNDERLIES SO MUCH It seems notice it. Things that build on composability of Things that build on composability of bool bool:: control �ow: almost all algorithms and loops, really a lot of caching schemes (or idempotent calculations)bool notice it. Things that build on composability of Things that build on composability of bool bool:: control �ow: almost all algorithms and loops, really a lot of caching schemes (or idempotent calculations)

unroll 4 Take-Away #4 Data-parallel types enable high-level parallelism abstractions with more control. Matthias Kretz CppCon ’23 41 GSI Helmholtz Center for Heavy Ion ResearchMotivation std::simd Overview unroll 4 Take-Away #4 Data-parallel types enable high-level parallelism abstractions with more control. Take-Away #5 Data-parallel types compose, allowing separation of concern. separation of range ResearchMotivation std::simd Overview Example: Image Processing Programming Models Outlook Summary Data structures are the main challenge for efficient data-parallel execution. • Translating an inherently data-parallel