mirror of
https://github.com/teivah/100-go-mistakes.git
synced 2026-06-21 00:47:11 +08:00
Missing link
This commit is contained in:
parent
c394febf0a
commit
08e93290d5
4 changed files with 6 additions and 3 deletions
|
|
@ -1284,12 +1284,14 @@ In summary, concurrency provides a structure to solve a problem with parts that
|
|||
|
||||
<!-- TODO Include Rob Pike's talk link-->
|
||||
|
||||
### [Thinking concurrency is always faster](https://teivah.medium.com/concurrency-isnt-always-faster-in-go-de325168907c) (#56)
|
||||
### Thinking concurrency is always faster (#56)
|
||||
|
||||
???+ info "TL;DR"
|
||||
|
||||
To be a proficient developer, you must acknowledge that concurrency isn’t always faster. Solutions involving parallelization of minimal workloads may not necessarily be faster than a sequential implementation. Benchmarking sequential versus concurrent solutions should be the way to validate assumptions.
|
||||
|
||||
Read the full section [here](56-concurrency-faster.md).
|
||||
|
||||
[Source code :simple-github:](https://github.com/teivah/100-go-mistakes/tree/master/src/08-concurrency-foundations/56-faster/)
|
||||
|
||||
### Being puzzled about when to use channels or mutexes (#57)
|
||||
|
|
|
|||
|
|
@ -3688,11 +3688,12 @@ One additional note: we must remember that the standard library has some existin
|
|||
<p>In summary, concurrency provides a structure to solve a problem with parts that may be parallelized. Therefore, <em>concurrency enables parallelism</em>.</p>
|
||||
<!-- TODO Include Rob Pike's talk link-->
|
||||
|
||||
<h3 id="thinking-concurrency-is-always-faster-56"><a href="https://teivah.medium.com/concurrency-isnt-always-faster-in-go-de325168907c">Thinking concurrency is always faster</a> (#56)</h3>
|
||||
<h3 id="thinking-concurrency-is-always-faster-56">Thinking concurrency is always faster (#56)</h3>
|
||||
<details class="info" open="open">
|
||||
<summary>TL;DR</summary>
|
||||
<p>To be a proficient developer, you must acknowledge that concurrency isn’t always faster. Solutions involving parallelization of minimal workloads may not necessarily be faster than a sequential implementation. Benchmarking sequential versus concurrent solutions should be the way to validate assumptions.</p>
|
||||
</details>
|
||||
<p>Read the full section <a href="56-concurrency-faster/">here</a>.</p>
|
||||
<p><a href="https://github.com/teivah/100-go-mistakes/tree/master/src/08-concurrency-foundations/56-faster/">Source code <span class="twemoji"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12 .297c-6.63 0-12 5.373-12 12 0 5.303 3.438 9.8 8.205 11.385.6.113.82-.258.82-.577 0-.285-.01-1.04-.015-2.04-3.338.724-4.042-1.61-4.042-1.61C4.422 18.07 3.633 17.7 3.633 17.7c-1.087-.744.084-.729.084-.729 1.205.084 1.838 1.236 1.838 1.236 1.07 1.835 2.809 1.305 3.495.998.108-.776.417-1.305.76-1.605-2.665-.3-5.466-1.332-5.466-5.93 0-1.31.465-2.38 1.235-3.22-.135-.303-.54-1.523.105-3.176 0 0 1.005-.322 3.3 1.23.96-.267 1.98-.399 3-.405 1.02.006 2.04.138 3 .405 2.28-1.552 3.285-1.23 3.285-1.23.645 1.653.24 2.873.12 3.176.765.84 1.23 1.91 1.23 3.22 0 4.61-2.805 5.625-5.475 5.92.42.36.81 1.096.81 2.22 0 1.606-.015 2.896-.015 3.286 0 .315.21.69.825.57C20.565 22.092 24 17.592 24 12.297c0-6.627-5.373-12-12-12"/></svg></span></a></p>
|
||||
<h3 id="being-puzzled-about-when-to-use-channels-or-mutexes-57">Being puzzled about when to use channels or mutexes (#57)</h3>
|
||||
<details class="info" open="open">
|
||||
|
|
|
|||
File diff suppressed because one or more lines are too long
Binary file not shown.
Loading…
Reference in a new issue