/
index.html
682 lines (408 loc) · 10.5 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
<!DOCTYPE html>
<html>
<head>
<title>Concurrency & Golang</title>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"/>
<style type="text/css">
@import url(//fonts.googleapis.com/css?family=Yanone+Kaffeesatz);
@import url(//fonts.googleapis.com/css?family=Droid+Serif:400,700,400italic);
@import url(//fonts.googleapis.com/css?family=Ubuntu+Mono:400,700,400italic);
.remark-slide-content {
background-image: url(./pics/adi_logo.png);
background-repeat: no-repeat;
background-position: 2% 98%;
background-size:10%;
}
body {
font-family: 'Droid Serif';
}
h1, h2, h3 {
font-family: 'Yanone Kaffeesatz';
font-weight: 400;
margin-bottom: 0;
}
.remark-slide-content h1 { font-size: 3em; }
.remark-slide-content h2 { font-size: 2em; }
.remark-slide-content h3 { font-size: 1.6em; }
.footnote {
position: absolute;
bottom: 3em;
}
li p { line-height: 1.25em; }
.red { color: #fa0000; }
.large { font-size: 2em; }
a, a > code {
color: rgb(249, 38, 114);
text-decoration: none;
}
code {
-moz-border-radius: 5px;
-web-border-radius: 5px;
background: #e7e8e2;
border-radius: 5px;
}
.remark-code, .remark-inline-code { font-family: 'Ubuntu Mono'; }
.remark-code-line-highlighted { background-color: #373832; }
.pull-left {
float: left;
width: 47%;
}
.pull-right {
float: right;
width: 47%;
}
.pull-right ~ p {
clear: both;
}
#slideshow .slide .content code {
font-size: 0.8em;
}
#slideshow .slide .content pre code {
font-size: 0.9em;
padding: 15px;
}
.inverse {
background: #272822;
color: #777872;
text-shadow: 0 0 20px #333;
}
.inverse h1, .inverse h2 {
color: #f3f3f3;
line-height: 0.8em;
}
/* Slide-specific styling */
#slide-inverse .footnote {
bottom: 12px;
left: 20px;
}
#slide-how .slides {
font-size: 0.9em;
position: absolute;
top: 151px;
right: 140px;
}
#slide-how .slides h3 {
margin-top: 0.2em;
}
#slide-how .slides .first, #slide-how .slides .second {
padding: 1px 20px;
height: 90px;
width: 120px;
-moz-box-shadow: 0 0 10px #777;
-webkit-box-shadow: 0 0 10px #777;
box-shadow: 0 0 10px #777;
}
#slide-how .slides .first {
background: #fff;
position: absolute;
top: 20%;
left: 20%;
z-index: 1;
}
#slide-how .slides .second {
position: relative;
background: #fff;
z-index: 0;
}
/* Two-column layout */
.left-column {
color: #777;
width: 20%;
height: 92%;
float: left;
}
.left-column h2:last-of-type, .left-column h3:last-child {
color: #000;
}
.right-column {
width: 75%;
float: right;
padding-top: 1em;
}
</style>
</head>
<body>
<textarea id="source">
class: center, middle
# Concurrency with Golang
### Nate Brennand
### ADI
---
# Agenda
- Concurrency
- Parallelism
- Asynchronous
- Threads
- Golang
---
layout: false
.left-column[
## Concurrency
]
.right-column[
__Concurrent__ programs can have multiple computations executing during overlapping periods of time.
This is opposed to __sequential__ programs in which no computations can be executed in overlapping periods of time.
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
]
.right-column[
Generally speaking, concurrency can be useful when there is large amounts of computation or when there is input/output:
- data analysis
- webservers
- filesystems
- web browsers
- smartphones
- etc
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
]
.right-column[
### We're going to focus on two ways you can execute your programs concurrently
### - asynchronous
### - parallel
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
]
.right-column[
So imagine we have a ton of bricks...
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
]
.right-column[
So imagine we have a ton of bricks...
... and we need to get them all to the oven to be fired ...
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
]
.right-column[
So imagine we have a ton of bricks...
... and we need to get them all to the oven to be fired ...
... thankfully we have a bunch of gophers to help!
]
--
.right-column[
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
### Parallelism
]
.right-column[
## Parallel Execution
Parallel execution is when your code takes advantage of each of your processors to make computations on each of them in parallel.
This is very useful in CPU-bound tasks as you are utilizing each core in your processor.
]
--
.right-column[
Think of each oven as a core in your CPU.
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
### Parallelism
]
.right-column[
## Parallel Execution
Parallel execution is when your code takes advantage of each of your CPU to make computations on each of them in parallel.
This is very useful in CPU-bound tasks as you are utilizing each processor.
### Is parallel always faster?
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
### Parallelism
]
.right-column[
## Parallel Execution
Parallel execution is when your code takes advantage of each of your CPU to make computations on each of them in parallel.
This is very useful in CPU-bound tasks as you are utilizing each processor.
### Is parallel always faster?
No, in tasks that are IO-bound, the added time to communicate between the cores in your CPU(s) can eliminate any advantage that spreading the work gained.
]
---
layout: false
.left-column[
## Concurrency
### When is this useful?
### Types of concurrency
### Parallelism
### Async
]
.right-column[
## Asynchronous Execution
An asynchronous function call is a call that executes in the background.
Asynchronous functions are useful in IO-bound tasks since
]
--
.right-column[
Imagine that every time you call `fire_bricks()` a gopher is sent to do your work!
You can call the function repeatedly and gophers will be sent to work at the same time.
However, you're limited by how many gophers can use the oven at once.
]
---
# So why have we been talking about gophers this whole time?
--
Gophers are the mascot of Go(lang), a statically typed language developed by Google.
Go is special in that there are concurrency primitives.
This makes it very simple to make your programs asynchronous or parallel.
---
## Concurrency Primitives
Golang is special in that you conccurency operators are primitives built into the language, not libraries you import.
- `go` is a keyword that creates a go-routine (like a thread).
- functions called with `go` are executed in the background
--
```go
func two() {
time.Sleep(time.Second)
print("2 ")
}
print("1 ")
go two()
print("3 ")
```
So what should this print?
--
### `1 3 2`
--
Check the link if you don't believe me! http://play.golang.org/p/m_LXVQhlru
---
## Concurrency Primitives
- `chan` is a channel (like a queue).
- Channels are used like queues, you can pass values in and take values out
- All operations are threadsafe.
- Channels must have a type
--
```go
func sayHi(msgChan chan string) {
msgChan <- "Hello"
}
// create a channel for strings
messageChan := make(chan string)
// call a function asynchronously
go sayHi(messageChan)
// wait for a return value
// this will block until a string is sent into messageChan
msg :=<- messageChan
```
---
layout: false
# How does Go parallelize?
--
The Golang runtime spreads the work of each go-routine between multiple threads.
Currently you must tell the runtime if you wish to utilize multiple cores (this is on the roadmap to be abstracted away).
```go
// enabling parallelism in Go
import "runtime"
runtime.GOMAXPROCS(runtime.NumCPU())
```
---
layout: false
.left-column[
## Golang
]
.right-column[
## A quick intro to Go
We're not going to do an overview of all the syntax, you can easily learn that on your own.
]
--
.right-column[
# Why should I try go?
]
--
.right-column[
- It's simple
- You'll learn almost the entire language by going through the tour
- It's easy to write
- It's Fast
- Runs close to C speed
- Also, the compiler is blazing
- Tools
]
---
layout: false
.left-column[
## Golang
### Tools
]
.right-column[
Despite it's young age, Golang has one of the most mature toolsets for development.
This makes writing Go a pleasure.
- Compile
- Since it's so fast, it's common to compile on save
- This makes your feedback loop very fast
- Build
- `go build` will intelligently find all dependencies as well as download them if necessary
- Formatting
- All Go code is formatted the same way
- `go fmt`
- Dependency management
- Simply `go get <repo name>` to download and install
- Installation
- `go install <repo name>`
- Want to install Ubuntu's enormous 23K commit devops system?
- `go install -v github.com/juju/juju/...`
- [Profiling](http://benchgraffiti.googlecode.com/hg/havlak/havlak1.svg)
- Plus many community built tools
]
---
## Now lets move on to some code
# http://bit.ly/adi_concurrency
### https://github.com/natebrennand/concurrency_and_golang/
<br>
<br>
<br>
If you wish to test out anything in Go without installing it:
## http://play.golang.org/
</textarea>
<script src="//gnab.github.io/remark/downloads/remark-latest.min.js">
</script>
<script>
var slideshow = remark.create();
</script>
</body>
</html>