Skip to content

translate one: Basic of Rust Concurrency #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
fwqaaq merged 7 commits into from
Jun 26, 2023
Merged

translate one: Basic of Rust Concurrency #5

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
0c8c11a
translate one: Basic of Rust Concurrency
fwqaaq Jun 20, 2023
417d6c8
thread scoped
fwqaaq Jun 21, 2023
4cf0b0c
Shared Ownership and Reference Counting
fwqaaq Jun 22, 2023
fad0e73
Borrowing and Data Races
fwqaaq Jun 24, 2023
5e2ce9e
Interior Mutability and thread safty
fwqaaq Jun 25, 2023
23a9a04
Locking: Mutexes and RwLocks
fwqaaq Jun 26, 2023
8612d60
end
fwqaaq Jun 26, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions 10_Ideas_and_Inspiration.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -84,11 +84,11 @@ Windows SRW 锁（[第8章中的“一个轻巧的读写锁”](./8_Operating_Sy
* [关于 Windows SRW 锁的实现](https://oreil.ly/El8GA)
* [基于队列的锁的 Rust 实现](https://oreil.ly/aFyg1)

## 基于 Parking 的锁
## 基于阻塞的锁

为了创建一个尽可能小的高效 mutex，你可以通过将队列移动到全局的数据结构，在 mutex 自身只留下 1 或者 2 个位，来构建基于队列的锁的想法。这样，mutex 仅需要是一个字节。你甚至可以把它放置在一些未使用的指针位中，这允许非常细粒度的锁定，几乎没有其他额外的开销。

全局的数据结构可以是一个 `HashMap`，将内存地址映射到等待该地址的 mutex 的线程队列。全局的数据结构通常叫做 `parking lot`，因为它是一组被 `park` 的线程合集。
全局的数据结构可以是一个 `HashMap`，将内存地址映射到等待该地址的 mutex 的线程队列。全局的数据结构通常叫做 `parking lot`，因为它是一组被阻塞（`park`）的线程合集。

![ ](./picture/raal_10in05.png)

Expand Down
Loading