forked from kripken/talks
-
Notifications
You must be signed in to change notification settings - Fork 0
/
berk.html
678 lines (586 loc) · 23.6 KB
/
berk.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
<html lang="en">
<head>
<meta charset="utf-8">
<title>Emscripten and asm.js: Approaching native speed in JavaScript</title>
<meta name="description" content="Emscripten: Compiling LLVM bitcode to JavaScript">
<meta name="author" content="Alon Zakai">
<meta name="apple-mobile-web-app-capable" content="yes" />
<meta name="apple-mobile-web-app-status-bar-style" content="black-translucent" />
<link rel="stylesheet" href="css/reveal.min.css">
<link rel="stylesheet" href="css/theme/sky.css" id="theme">
<!-- For syntax highlighting -->
<link rel="stylesheet" href="lib/css/zenburn.css">
<!-- If the query includes 'print-pdf', use the PDF print sheet -->
<script>
document.write( '<link rel="stylesheet" href="css/print/' + ( window.location.search.match( /print-pdf/gi ) ? 'pdf' : 'paper' ) + '.css" type="text/css" media="print">' );
</script>
<!--[if lt IE 9]>
<script src="lib/js/html5shiv.js"></script>
<![endif]-->
<style type="text/css">
h2 b {
color: #048;
}
h3 b {
color: #369;
}
b {
color: #63a;
}
strong {
color: #c11;
}
</style>
</head>
<body>
<div class="reveal">
<!-- Any section element inside of this container is displayed as a slide -->
<div class="slides">
<section>
<h2><b style="color: #f00">Emscripten</b> <b>and</b> <b style="color: #f00">asm.js</b><b>:<br>Approaching native<br>speed in JavaScript</b></h2>
<br>
<h3>Alon Zakai (Mozilla)</h3>
<br>
<!--p>(these slides just tweeted at <a href="http://twitter.com/#!/kripken">@kripken</a>)</p-->
<p><a href="http://twitter.com/#!/kripken">@kripken</a></p>
</section>
<section>
<br>
<p><b>JavaScript</b>..? <strong>Native speed</strong>..?</p>
<br>
<img src="confusing_bubble.jpg" style="border: 1px solid black; box-shadow: 7px 7px 7px rgba(0,0,0,0.5)" height="350">
</section>
<section>
<h3><b>The Web</b></h3>
<img src="browser-logos.png" style="border: 0; box-shadow: none; height: 4em">
<br>
<p class="fragment">Biggest <b>open</b> and <b>standards-based</b> platform</p>
<p class="fragment">Great way to reach people</p>
<p class="fragment">But it only runs JavaScript..</p>
<br>
<img src="HTML5.png" style="border: 0; box-shadow: none; height: 4em">
</section>
<section>
<a href="http://emscripten.org"><img src="emscripten_switch_logo.png" height=150></a>
<br>
<center>
<table style="background-color: white; padding: 0.6em; border: 0.1em solid #027; border-radius: 1em; box-shadow: 7px 7px 7px rgba(0,0,0,0.6);">
<tr><td><center style="white-space: nowrap">C/C++</center></td><td><center><strong> ⇛⇛⇛ <br><br>Clang+LLVM</strong></center></td><td><center>LLVM IR</center></td><td><center><b>⇛⇛⇛<br><br>Emscripten</b></center></td><td><center>JS</center></td></tr>
</table>
</center>
<br>
<br>
<p>Lets people port C/C++ codebases to the web</p>
<br>
<p class="fragment">Can also port virtual machines (VMs) and run their languages on the web too: Python, Lua, Ruby</p>
</section>
<section>
<a href="http://emscripten.org"><img src="emscripten_switch_logo.png" height=150></a>
<br>
<p><strong>Open source</strong> (MIT/LLVM)</p>
<br>
<p class="fragment">Began in <b>2010</b></p>
<br>
<p class="fragment">Most of the codebase is not the core compiler, but <b>libraries + toolchain + test suite</b></p>
</section>
<section>
<h3><b>How does it work?</b></h3>
<br>
<p class="fragment">Compiling C++ is incredibly complicated, so we let Clang+LLVM reduce it to <b>LLVM IR</b> first</p>
<br>
<p class="fragment">Compiling LLVM IR to JS is still pretty hard though!</p>
</section>
<section>
<h3><b>LLVM vs. JavaScript</b></h3>
<br>
<p>Random (unrelated) code samples from each:</p>
<pre><code>
%r = load i32* %p
%s = shl i32 %r, 16
%t = call i32 @calc(i32 %r, i32 %s)
br label %next
</code></pre>
<hr>
<pre><code>
var x = new MyClass('name', 5).chain(function(arg) {
if (check(arg)) doMore({ x: arg, y: [1,2,3] });
else throw 'stop';
});
</code></pre>
<p class="fragment">What could be more different? ;)</p>
</section>
<section>
<h3><b>Numeric Types</b></h3>
<br>
<center>
<table>
<tr><td><b>LLVM</b></td><td width="5%"></td><td><center>i8, i16, i32, float, double</center></td></tr>
<tr><td><hr></td><td width="5%"></td><td><hr></td></tr>
<tr><td><b><center>JS</center></b></td><td width="5%"></td><td><center>double</center></td></tr>
</table>
</center>
</section>
<section>
<h3><b>Performance Model</b></h3>
<br>
<center>
<table>
<tr><td><b>LLVM</b></td><td width="5%"></td><td><center>types and ops map ~1:1 to CPU</center></td></tr>
<tr><td><hr></td><td width="5%"></td><td><hr></td></tr>
<tr><td><b><center>JS</center></b></td><td width="5%"></td><td><center>virtual machine (VM), just in time (JIT) compilers w/ type profiling, garbage collection, etc.</center></td></tr>
</table>
</center>
</section>
<section>
<h3><b>Control Flow</b></h3>
<br>
<center>
<table>
<tr><td><b>LLVM</b></td><td width="5%"></td><td><center>Functions, basic blocks & branches</center></td></tr>
<tr><td><hr></td><td width="5%"></td><td><hr></td></tr>
<tr><td><b><center>JS</center></b></td><td width="5%"></td><td><center>Functions, ifs and loops - no goto!</center></td></tr>
</table>
</center>
</section>
<section>
<h3><b>Variables</b></h3>
<br>
<center>
<table>
<tr><td><b>LLVM</b></td><td width="5%"></td><td><center>Local vars have function scope</center></td></tr>
<tr><td><hr></td><td width="5%"></td><td><hr></td></tr>
<tr><td><b><center>JS</center></b></td><td width="5%"></td><td><center class="fragment">Local vars have function scope</center></td></tr>
</table>
</center>
<br>
<div>
<p class="fragment" style="margin: 0 auto; text-align:center; padding: 2em">Ironic, actually - many wish JS had <strong>block</strong> scope, like most languages...</p>
</div>
</section>
<section>
<h3><b>Ok, how do we get<br>around these issues?</b></h3>
</section>
<section>
<pre><code>
// LLVM IR
define i32 @func(i32* %p) {
%r = load i32* %p
%s = shl i32 %r, 16
%t = call i32 @calc(i32 %r, i32 %s)
ret i32 %t
}
</code></pre>
<p><b>⇒</b> Emscripten <b>⇒</b></p>
<pre><code>
// JS
function func(p) {
var r = HEAP[p];
return calc(r, r << 16);
}
</code></pre>
<p class="fragment">Almost direct mapping in many cases</p>
</section>
<section>
<p>Another example:</p>
<pre><code contenteditable> float array[5000]; // C++
int main() {
for (int i = 0; i < 5000; ++i) {
array[i] += 1.0f;
}
}</code></pre>
<p><b>⇒</b> Emscripten <b>⇒</b></p>
<pre><code contenteditable> var heap = new ArrayBuffer(32768); // JS
var g = new Float32Array(heap);
function main() {
var a = 0, b = 0;
do {
a = 8 + (b << 2) | 0;
g[a >> 2] = +g[a >> 2] + 1.0;
b = b + 1 | 0;
} while ((b | 0) < 5000);
}</code></pre>
<p class="fragment">This "style" of code is a subset of JS called <b><a href="http://asmjs.org">asm.js</a></b></p>
</section>
<section>
<p>JS began as a slow interpreted language</p>
<br>
<p class="fragment">Competition ⇒ <b>type-specializing</b> JITs</p>
<br>
<p class="fragment">Those are very good at <b>statically typed</b> code</p>
</section>
<section>
<p>But many <b>heuristics</b> lie between source code and actually being fully typed and optimized</p>
<br>
<p class='fragment'>What if we made some JS code <b>really really easy</b> to optimize, with as few heuristics as possible?</p>
<br>
<p class='fragment'>That's basically what <strong>asm.js</strong> is</p>
</section>
<section>
<p>asm.js is a <b>subset</b> of JavaScript (not a new language, no new semantics, all 100% backwards compatible), written in a format that is extremely <b>easy to optimize</b></p>
<br>
<div class="fragment">
<pre><code>
function twice(x) {
x = x | 0;
return x + x | 0;
}
</code></pre>
<br>
<p><code>(x+1)|0</code> <b>⇒</b> 32-bit integer + in modern JS VMs</p>
<br>
<p>No need to profile types, can be optimized ahead of time (AOT) from source</p>
</div>
</section>
<section>
<pre><code> var heap = new ArrayBuffer(32768);
var heap8 = new Int8Array(heap);
var heap16 = new Int16Array(heap);
var heap32 = new Int32Array(heap);
function mem_access() {
return heap32[heap8[100] >> 2];
}</code></pre>
<br>
<p><strong>Loads</strong> in LLVM IR become <strong>reads</strong> from typed arrays in JS, which become <strong>reads</strong> in machine code</p>
<br>
<p class="fragment">Emscripten's <b>memory model</b> is identical to LLVM's, including aliasing, so can use <b>all</b> LLVM opts</p>
</section>
<section>
<h3><b>Optimizing</b></h3>
<br>
<p>Aside from LLVM running normal compiler optimizations (licm, alias analysis, etc.), Emscripten has <strong>3 JS-specific optimizations</strong> as well</p>
</section>
<section>
<h3><b>1. Reloop</b></h3>
<pre><code> block0:
; code0
br i1 %cond, label %block0, label %block1
block1:
; code1
br %label block0
</code></pre>
<p>Without relooping (emulated gotos):</p>
<pre><code> var label = 0;
while (1) switch (label) {
case 0:
// code0
label = cond ? 0 : 1; break;
case 1:
// code1
label = 0; break;
}
</code></pre>
</section>
<section>
<h3><b>1. Reloop</b></h3>
<pre><code> block0:
; code0
br i1 %cond, label %block0, label %block1
block1:
; code1
br %label block0
</code></pre>
<p>With relooping:</p>
<pre><code>
while (1) {
do {
// code0
} while (cond);
// code1
}
</code></pre>
</section>
<section>
<h3><b>1. Reloop</b></h3>
<br>
<p>Relooping allows JS VM to optimize better, as it can <strong>understand</strong> control flow</p>
<br>
<p class="fragment">Emscripten Relooper code is <b>generic</b>, written in C++, and used by other projects (e.g., Duetto)</p>
</section>
<section>
<h3><b>2. Expressionize</b></h3>
<pre><code>
var a = g(x);
var b = a + y;
var c = HEAP[b];
var d = HEAP[20];
var e = x + y + z;
var f = h(d, e);
FUNCTION_TABLE[c](f);
</code></pre>
<h3><b>⇒</b></h3>
<pre><code>
FUNCTION_TABLE[HEAP[g(x) + y](h(HEAP[20], x + y + z));
</code></pre>
</section>
<section>
<h3><b>2. Expressionize</b></h3>
<br>
<p>Improves <b>JIT time</b> and <b>execution speed</b>: fewer variables ⇒ less stuff for JS engines to worry about</p>
<br>
<p class="fragment">Reduces <b>code size</b></p>
</section>
<section>
<h3><b>3. Registerize</b></h3>
<pre><code>
var a = g(x) | 0; // integers
var b = a + y | 0;
var c = HEAP[b] | 0;
var d = +HEAP[20]; // double
</code></pre>
<h3><b>⇒</b></h3>
<pre><code>
var a = g(x) | 0;
a = a + y | 0;
a = HEAP[a] | 0;
var d = +HEAP[20];
</code></pre>
</section>
<section>
<h3><b>3. Registerize</b></h3>
<br>
<p>Looks like regalloc, but goal is different: Minimize <strong># of total variables</strong> (in each type), <b>not</b> spills</p>
<br>
<p class="fragment">JS VMs will do regalloc, only they know the actual # of registers</p>
<br>
<p class="fragment">Benefits <b>code size & speed</b> like expressionize</p>
</section>
<section>
<h3><b>Missing Pieces</b></h3>
<br>
<p>(Surprisingly!) JS already had almost everything a compiler target needs</p>
<br>
<p class="fragment">But a few things turn out to be missing: <b>32-bit integer multiply</b>, <strong>single-precision floats</strong> etc.</p>
</section>
<section>
<h3><b>32-bit integer mul</b></h3>
<br>
<p>As mentioned, <code>(x+y)|0</code> is identical to 32-bit +<p>
<br>
<p>However, <code>(x*y)|0</code> is <strong>not</strong> identical to 32-bit *<p>
<br>
<p class="fragment">Numbers are <b>doubles</b> in JS, and multiplying large-enough 32-bit values reaches the range (53 bits) where doubles get rounded</p>
</section>
<section>
<p>Solution: Add <b>Math.imul</b> to the JavaScript language</p>
<br>
<p>(In practice, not as important as you might think: Most integer multiplies are of small constants, where the 53 bit "danger zone" is unreachable)</p>
</section>
<section>
<h3><b>32-bit Floats</b></h3>
<br>
<p style="box-shadow: 5px 5px 5px rgba(0,0,0,0.4); background-color: black; padding: 1em"><b style="color: #f7f"><code>x<sub style="font-size:50%">f32</sub> <b style="color: #ff0">+<sub style="font-size:50%">f32</sub></b> y<sub style="font-size:50%">f32</sub><br><b style="color:#fff">==</b><br><b style="color:#84f">f32(</b> <b style="color:#f04">f64(</b>x<sub style="font-size:50%">f32</sub><b style="color:#f04">)</b> <b style="color: #ff0">+<sub style="font-size:50%">f64</sub></b> <b style="color:#f04">f64(</b>y<sub style="font-size:50%">f32</sub><b style="color:#f04">)</b> <b style="color:#84f">)</b></code></b></p>
<p>Also <code>-,*,/,sqrt, </code> etc. (but not everything, e.g. not <code>sin</code>)</p>
<br>
<p class="fragment">Only true because of the exact definition of IEEE754 doubles and floats (# of bits in exponent, definition of rounding, etc.)</p>
</section>
<section>
<h3><b>float32 in practice</b></h3>
<br>
<p><b>Typed arrays</b>, e.g. stuff like this is common in <b>WebGL</b> code</p>
<br>
<pre><code>
var f32 = new Float32Array(1000);
for (var i = 0; i < 1000; ++i) {
f32[i] = f32[i] + 1;
}
</code></pre>
<br>
<p>Optimizable :)</p>
</section>
<section>
<p>Fragile, though - needs to be cast back to float32 immediately</p>
<br>
<pre><code>
var f32 = new Float32Array(1000);
for (var i = 0; i < 1000; ++i) {
f32[i] = 2*f32[i] + 1;
}
</code></pre>
<br>
<p><b>Not</b> optimizable :(</p>
</section>
<section>
<p><b>Math.fround</b>: explicitly cast a number to 32-bit float precision</p>
<br>
<pre><code>
var f32 = new Float32Array(1000);
for (var i = 0; i < 1000; ++i) {
f32[i] = Math.fround(2*f32[i]) + 1;
}
</code></pre>
<br>
<p>Optimizable :)</p>
</section>
<section>
<h3><b>fround support</b></h3>
<br>
<p>In ES6, already in Firefox, Safari, Chrome (behind a flag), easy to polyfill:</p>
<br>
<pre><code>
Math.fround = Math.fround || (function() {
var temp = new Float32Array(1);
return function fround(x) {
temp[0] = +x;
return temp[0];
}
})();
</code></pre>
<p>or</p>
<pre><code>
Math.fround = Math.fround || function(x) { return x };
</code></pre>
</section>
<section>
<h3><b>float32 benchmarks</b></h3>
<br>
<hr>
<table>
<tr><td></td><td>Matrix Inversions</td><td>Matrix Graphics</td><td>Exponential</td><td>FFT</td></tr>
<tr><td>x86</td><td><b>33%</b></td><td><b>60%</b></td><td><b>30%</b></td><td><b>16%</b></td></tr>
<tr><td>ARM</td><td><b>38%</b></td><td><b>38%</b></td><td><b>24%</b></td><td><b>33%</b></td></tr>
</table>
<hr>
<br>
<p>% speedup with float optimizations (higher is better; <a href=https://blog.mozilla.org/javascript/2013/11/07/efficient-float32-arithmetic-in-javascript/">source)</a>
</section>
<section>
<p>Overall, where does performance stand now?</p>
<a class="fragment" href="asm_apr_2014.png"><img src="asm_apr_2014.png" style="box-shadow: 5px 5px 5px rgba(0,0,0,0.2)"></a>
<!--p><small>(run on 64-bit linux)</small></p-->
</section>
<section>
<h3><b>Unity demo</b></h3>
<p><iframe width="840" height="472" src="//www.youtube.com/embed/cWIRUaR9G4w" frameborder="0" allowfullscreen></iframe></p>
<p class="fragment">Also support from many other engines in the games industry</p>
</section>
<section>
<h3><b>asm.js Opts in Firefox</b></h3>
<br>
<p><b>AOT</b> - full optimizing JIT <b>always</b> run, using full type info</p>
<br>
<p class="fragment">AOT done in <b>parallel</b>, results <b>cached</b></p>
<br>
<p class="fragment">No need for bailouts, we know <b>many corner cases are impossible</b>, etc.</p>
<br>
<p class="fragment">On 64-bit, can do <b>zero-cost bounds checks</b> using a signal handler</p>
</section>
<section>
<h3><b>asm.js perf summary</b></h3>
<br>
<p>Around <strong>67%</strong> of native speed on Firefox, not much worse on other browsers</p>
<br>
<p class="fragment">Sufficient <b>even for AAA game engines</b></p>
<br>
<p class="fragment">But why isn't it <b>100%</b>?</p>
</section>
<section>
<h3><b>Possible reasons</b></h3>
<br>
<p>JavaScript <b>VM</b> limitations?</p>
<br>
<p>JavaScript <b>language</b> limitations?</p>
<br>
<p><b>asm.js/Emscripten</b> limitations?</p>
</section>
<section>
<h3><b>1. JS VMs?</b></h3>
<br>
<p>Plausible, C compilers have many more years of development, many more optimizations implemented, etc.</p>
<br>
<p>Very hard today to speed up gcc by even 1% - it's already so optimized</p>
<br>
<p>The <b>last few %</b> to catch up to gcc are the hardest</p>
</section>
<section>
<h3><b>2. JS language?</b></h3>
<br>
<p>Plausible, we've seen Math.imul and Math.fround which were necessary to add</p>
<br>
<p>We still lack things like ctlz, float-to-int bitcasts, etc.</p>
<br>
<p>JS is <b>portable</b> and <b>sandboxed</b>, natural to expect some overhead there</p>
</section>
<section>
<h3><b>3. asm.js/Emscripten?</b></h3>
<br>
<p>Plausible, asm.js's memory model is a single big array, so there's a <b>base offset</b> that must always be added</p>
<br>
<p>Limitations of Emscripten's additional optimization passes (relooper, etc)</p>
</section>
<section>
<p>Many possibilities here, how can we estimate them?</p>
</section>
<section>
<p>One idea: Run asm.js in a normal C compiler</p>
<br>
<br>
<table style="background-color: white; padding: 0.6em; border: 0.1em solid #027; border-radius: 1em; box-shadow: 7px 7px 7px rgba(0,0,0,0.6);">
<tr><td><center style="white-space: nowrap">C/C++</center></td><td><center><strong> ⇛⇛⇛ <br><br>Clang +<br>LLVM+<br>Emscripten</strong></center></td><td><center>asm.js</center></td><td><center><b>⇛⇛⇛<br><br>Emscripten<br>C Backend</b></center></td><td><center>C</center></td></tr>
</table>
<br>
<br>
<p class="fragment">If it's as fast as the original C, nothing was lost that a sufficiently smart compiler cannot optimize</p>
</section>
<section>
<a href="cbackend.png"><img src="cbackend.png" style="box-shadow: 5px 5px 5px rgba(0,0,0,0.2)"></a>
</section>
<section>
<img src="cbackend.png" style="box-shadow: 5px 5px 5px rgba(0,0,0,0.2); width: 50%">
<br>
<br>
<p>C backend output is <b>closer to original</b> than asm.js</p>
<br>
<p>Indicates much of the slowdown is due to <strong>JS VMs</strong></p>
</section>
<section>
<img src="cbackend.png" style="box-shadow: 5px 5px 5px rgba(0,0,0,0.2); width: 50%">
<br>
<br>
<p>Cases where the C backend output is <b>slower</b> than the original are interesting</p>
<br>
<p>zlib and fannkuch, seem to suffer from the <strong>base offset</strong> issue - which we will try to optimize (using addressing modes perhaps)</p>
</section>
<section>
<img src="cbackend.png" style="box-shadow: 5px 5px 5px rgba(0,0,0,0.2); width: 50%">
<br>
<br>
<p>(why is the C backend <b>faster</b> than the original in one case..?)</p>
</section>
<section>
<h3><b>Open Questions</b></h3>
<br>
<p class="fragment">Can we compile <b>more languages</b> into asm.js? (<strong>JITs</strong>!)</p>
<br>
<p class="fragment">Better <b>sandboxing</b> models?</p>
<br>
<p class="fragment"><b>Safe multithreading</b> models?</p>
</section>
<section>
<p><b style="color: #c11">Thank you for listening!</b></p>
<br>
<p><b>Questions?</b></p>
</section>
</div>
</div>
<script src="lib/js/head.min.js"></script>
<script src="js/reveal.min.js"></script>
<script>
// Full list of configuration options available here:
// https://github.com/hakimel/reveal.js#configuration
Reveal.initialize({
controls: true,
progress: true,
history: true,
center: true,
theme: 'sky', //Reveal.getQueryHash().theme, // available themes are in /css/theme
transition: Reveal.getQueryHash().transition || 'fade', // default/cube/page/concave/zoom/linear/fade/none
// Optional libraries used to extend on reveal.js
dependencies: [
{ src: 'lib/js/classList.js', condition: function() { return !document.body.classList; } },
{ src: 'plugin/highlight/highlight.js', async: true, callback: function() { hljs.initHighlightingOnLoad(); } },
// { src: 'plugin/remotes/remotes.js', async: true, condition: function() { return !!document.body.classList; } }
]
});
</script>
</body>
</html>