filmov
tv
Parallel Cost Semantics and Bounded Implementations [1/5] - Guy Blelloch - OPLSS 2018
Показать описание
Oregon Programming Languages Summer School
Parallelism and Concurrency
July 3-21, 2018
University of Oregon
Title: Cost Models Based on the Lambda-Calculus
Speaker: Guy Blelloch, Carnegie Mellon University
Date: Monday, 9 July 2018, Session 1
Topics: parallelism vs. concurrency ; lambda-calculus as a cost model ; Church/Turing hypothesis ; abstract machine models and simulations: random access, pointer, parallel ; call-by-value lambda-calculus ; inherent parallelism of lambda-calculus ; cost semantics, sequential and parallel ; work and span/depth ; sequential algorithms as side effects of parallel algorithms ; work efficiency ; asymptotic cost ; simulation: sequential and parallel CEK machines ; simulation bounds ; quicksort algorithm ; quicksort complexity ; tree quicksort ; quicksort's parallelism
© 2018, University of Oregon
Parallelism and Concurrency
July 3-21, 2018
University of Oregon
Title: Cost Models Based on the Lambda-Calculus
Speaker: Guy Blelloch, Carnegie Mellon University
Date: Monday, 9 July 2018, Session 1
Topics: parallelism vs. concurrency ; lambda-calculus as a cost model ; Church/Turing hypothesis ; abstract machine models and simulations: random access, pointer, parallel ; call-by-value lambda-calculus ; inherent parallelism of lambda-calculus ; cost semantics, sequential and parallel ; work and span/depth ; sequential algorithms as side effects of parallel algorithms ; work efficiency ; asymptotic cost ; simulation: sequential and parallel CEK machines ; simulation bounds ; quicksort algorithm ; quicksort complexity ; tree quicksort ; quicksort's parallelism
© 2018, University of Oregon
1:20:46
1:08:55
1:11:26
1:20:31
1:26:03
1:18:44
![[SAS] Semantic Foundations](https://i.ytimg.com/vi/PKKYyfMHFug/hqdefault.jpg)
0:33:14
0:05:34
0:01:36
0:40:54
0:00:15
0:19:16
1:30:09
1:11:01
1:00:04
0:06:38
1:04:10
0:00:26
1:14:39
0:32:54
1:07:21
0:20:54
1:28:38
0:42:12