Simon Peyton Jones: Data Parallel Haskell
推荐理由
a promising language abstraction to do hard things with parallelism relatively easily
说明
这是2010年由nuACM发布的一部演讲,主题归在Functional programming。它讲的是data parallel programming这一支里的具体问题,而不是把整个领域扫一遍。适合想看推导、证明或实现细节的人。内容上可以概括成:Simon Peyton Jones explains nested data parallelism and Data Parallel Haskell, an approach to exploiting multicore and distributed hardware while keeping a simple single-control-flow programming model.这些读者给出的理由,核心是:Recommended as a fascinating look at easy parallelism abstractions, though other commenters note the approach never beat sequential C by much.它贴着当时的技术,看的时候要记得那是那个年份的判断。从2010年到2017年,有5位不同的读者在5个不同月份把它推荐出来,其中明确叫别人去看的有0次。适合一次性看完。讲者把一个判断讲透,演示是在给这个判断配例子。如果已经会了基本定义,就把注意力放在它怎么把data parallel programming变成能跟着复述的例子。
视频信息
- 频道
- nuACM
- 时长
- 1 小时 19 分
- 发布年份
- 2010
同主题更多
- Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
- The Soul of Erlang and Elixir • Sasa Juric • GOTO 2019
- "Simple Made Easy" - Rich Hickey (2011)
- "Making Impossible States Impossible" by Richard Feldman
- William Byrd on "The Most Beautiful Program Ever Written" [PWL NYC]
- The Value of Values with Rich Hickey