Add new section "Shared Resources" and "Lock-Free" #15
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
jserv
changed the title
jserv
reviewed
Jun 28, 2024
jserv
requested changes
Jul 3, 2024
There was a problem hiding this comment.
- Squash the commits for reviewing.
- Check https://cbea.ms/git-commit/ carefully and refine the git commit messages.
- Always use lowercase filenames.
weihsinyeh
changed the title
jserv
reviewed
Jul 21, 2024
concurrency-primer.tex
Outdated
| then the second thread locks another mutex and subsequently attempts to lock the mutex held by the first thread. | ||
| At the same time, the first thread also tries to lock the mutex held by the second thread. | ||
| Then the deadlock occurs. | ||
| Therefore, we can see that deadlock happens when different threads lock in incompatible orders, |
There was a problem hiding this comment.
Proofread as following:
Therefore, we can see that deadlock occurs when different threads acquire locks in incompatible orders, leading to system immobilization as threads perpetually wait on each other.
jserv
reviewed
Jul 21, 2024
jserv
reviewed
Jul 21, 2024
jserv
changed the title
jserv
requested changes
Jul 22, 2024
Expand the shared resources from the programmer's view in "Read Modify Write" to the cache-line perspective in section "Shared Resources". Move the original "Cache effects and false sharing" to "Shared Resources". Add an explanation of how the scalability of locks will be limited by cache coherence. Change the title of Section "Atomic operations as building blocks" to "Concurrency tools and synchronization mechanisms". Introduce a blocking mechanism with its issues, including waiting times, deadlock, and scalability. Give an example of how synchronization without using a lock can also lead to a livelock. Introduce the three types of progress, which are wait-free, lock-free, and obstruction-free. - Add a figure containing three tables showing the progress of every thread and the progress of the overall system. Give a SPMC problem to explain how to achieve fully lock-free by using algorithms and data structure designs with appropriate synchronization mechanisms and concurrency tools. - Add two flowcharts: one for "lock-based" solution 1 and another for "lock-based and lock-free" solution 2 and a diagram illustrating different data structures to show different data structures.
|
Thank @weihsinyeh for contributing! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Address false sharing issues within shared resources.
Proceed to bottleneck issues in shared resources due to communication.