Главная
Study mode:
on
1
Intro
2
Goals
3
Join
4
Divide Conquer
5
Quicksort
6
Partition
7
Parallel Quicksort
8
Work Stealing
9
Join Pseudocode
10
Parallel Iterator
11
Conclusion
12
Rust offers a great foundation
13
Rust Github
14
CrossBeam
15
CrossBeam vs Java
16
Messy Protocol
17
Concurrent Data Structures
18
Hashmap Example
19
LockFree Data Structures
20
Stack
21
Stack Code
22
Stack Representation
23
Pop Representation
24
Pop Allocation
25
Memory Management
26
Rust Makes Sense
27
Two Main Observations
28
The Problem
29
Cache Concerns
Description:
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.

Bay Area Rust Meetup - Parallel Programming and Concurrent Data Structures

Rust
Add to list