Bay Area Rust Meetup - Parallel Programming and Concurrent Data Structures

Explore parallel programming concepts and Rust's capabilities in this Bay Area Rust Meetup talk from January 2016. Dive into topics such as divide and conquer algorithms, quicksort, work stealing, and parallel iterators. Learn how Rust provides a solid foundation for concurrent programming, and examine its GitHub presence. Compare CrossBeam with Java implementations and discuss messy protocols. Investigate concurrent data structures, including hashmap examples and lock-free designs. Analyze stack implementations, memory management, and cache concerns in Rust. Gain insights into Rust's approach to parallel computing and its advantages for building efficient, concurrent systems.

Intro
Goals
Join
Divide Conquer
Quicksort
Partition
Parallel Quicksort
Work Stealing
Join Pseudocode
Parallel Iterator
Conclusion
Rust offers a great foundation
Rust Github
CrossBeam
CrossBeam vs Java
Messy Protocol
Concurrent Data Structures
Hashmap Example
LockFree Data Structures
Stack
Stack Code
Stack Representation
Pop Representation
Pop Allocation
Memory Management
Rust Makes Sense
Two Main Observations
The Problem
Cache Concerns