Simon Peyton Jones: Data Parallel Haskell

Why HN readers recommended it

Recommended as a fascinating look at easy parallelism abstractions, though other commenters note the approach never beat sequential C by much.

This is a summary from the source dataset, not an endorsement by Hacker News or the video creator.

Video & recommendation details

Creator / channel

nuACM

Topic

data parallel programming

Format

talk

Level

advanced

HN recommenders in dataset

5

HN mentions in dataset

11

Recommendation years in dataset

2010–2017

These counts and years describe the included Hacker News records; they are not YouTube views or the video’s publication date.

From the original HN conversations

Excerpts from the recorded comments. Follow each source for the full comment and surrounding discussion.

• While this isn't undeniable proof, it's interesting none the less, Simon Peyton Jones: Data Parallel Haskell. [VIDEO] He talks about how this scheme can parallelize non-trivial data structures, and how tedious book keeping can be avoided. I haven't used it yet in a project, so …

• Here's the main Haskell hero, Simon Peyton Jones giving a talk about data parallel Haskell, which I think is a promising language abstraction to do hard things with parallelism relatively easily: [VIDEO] As for techniques that can be used now: Haskell's `par` and `pseq` combinators …

• This is both a straw man (OP asked for limited help, not omnipotence), and predicting the future by drawing a line from the past. Functional compilers that outperform hand tuned C++ on many core machines may be possible, but very hard. Just because everyone has …