Upload

Loading...

This video is unavailable.

Simon Peyton Jones: Data Parallel Haskell

Like this video?

Sign in to make your opinion count.

Don't like this video?

Sign in to make your opinion count.

Want to watch this again later?

Sign in to add this video to a playlist.

Uploaded on Apr 23, 2010

There are many approaches to exploiting multi-cores, but a particularly promising one is the "data-parallel" paradigm, because it combines massive parallelism (on both shared and distributed memory) with a simple, single-control-flow programming model. Indeed, I think that data parallelism is the only way we will be able to exploit tens or hundreds of processors effectively.

Alas, data-parallel programming is usually restricted to "flat" data parallelism, which is good for implementers but bad for programmers. Instead, I'll describe the "nested" data parallel programming model, first developed in the 90's by Blelloch and Sabot. It is great for programmers but much harder to implement; as a result, it's virtually unknown in practice. It's really only feasible to support nested data parallelism in a purely functional language, so we are building a high-performance implementation in Haskell.

Loading...

Loading...

Loading...

Transcript

The interactive transcript could not be loaded.

Loading...

Loading...

Ratings have been disabled for this video.
Rating is available when the video has been rented.
This feature is not available right now. Please try again later.

Loading...

Loading...
Working...
to add this to Watch Later

Add to